./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.09.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_label45+token_ring.09.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 b445a4f49d9151eb44c8190083d36f280681906d4dfab457d725a1f68c1551d8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:02:24,454 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:02:24,512 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:02:24,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:02:24,521 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:02:24,541 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:02:24,542 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:02:24,542 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:02:24,542 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:02:24,543 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:02:24,543 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:02:24,543 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:02:24,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:02:24,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:02:24,544 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:02:24,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:02:24,545 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:02:24,545 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:02:24,545 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:02:24,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:02:24,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:02:24,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:02:24,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:02:24,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:02:24,545 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:02:24,545 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:02:24,545 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:02:24,545 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:02:24,545 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:02:24,546 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:02:24,546 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:02:24,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:02:24,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:02:24,546 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:02:24,546 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:02:24,546 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:02:24,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:02:24,546 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:02:24,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:02:24,546 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:02:24,547 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:02:24,547 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:02:24,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:02:24,547 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 -> b445a4f49d9151eb44c8190083d36f280681906d4dfab457d725a1f68c1551d8 [2025-03-16 20:02:24,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:02:24,820 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:02:24,822 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:02:24,823 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:02:24,823 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:02:24,825 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.09.cil-2.c [2025-03-16 20:02:25,998 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5fc82fd/cb1416b8cd6b422bad43474c0aee5c91/FLAG133ddf68b [2025-03-16 20:02:26,646 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:02:26,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.09.cil-2.c [2025-03-16 20:02:26,704 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5fc82fd/cb1416b8cd6b422bad43474c0aee5c91/FLAG133ddf68b [2025-03-16 20:02:27,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1d5fc82fd/cb1416b8cd6b422bad43474c0aee5c91 [2025-03-16 20:02:27,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:02:27,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:02:27,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:02:27,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:02:27,073 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:02:27,073 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:02:27" (1/1) ... [2025-03-16 20:02:27,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5224d853 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:27, skipping insertion in model container [2025-03-16 20:02:27,074 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:02:27" (1/1) ... [2025-03-16 20:02:27,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:02:28,250 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_label45+token_ring.09.cil-2.c[380323,380336] [2025-03-16 20:02:28,276 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_label45+token_ring.09.cil-2.c[383339,383352] [2025-03-16 20:02:28,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:02:28,510 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:02:29,067 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_label45+token_ring.09.cil-2.c[380323,380336] [2025-03-16 20:02:29,072 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_label45+token_ring.09.cil-2.c[383339,383352] [2025-03-16 20:02:29,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:02:29,142 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:02:29,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:29 WrapperNode [2025-03-16 20:02:29,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:02:29,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:02:29,145 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:02:29,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:02:29,150 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:02:29" (1/1) ... [2025-03-16 20:02:29,208 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:02:29" (1/1) ... [2025-03-16 20:02:29,467 INFO L138 Inliner]: procedures = 62, calls = 69, calls flagged for inlining = 39, calls inlined = 39, statements flattened = 13020 [2025-03-16 20:02:29,468 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:02:29,468 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:02:29,469 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:02:29,469 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:02:29,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:29" (1/1) ... [2025-03-16 20:02:29,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:29" (1/1) ... [2025-03-16 20:02:29,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:29" (1/1) ... [2025-03-16 20:02:29,638 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:02:29,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:29" (1/1) ... [2025-03-16 20:02:29,638 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:29" (1/1) ... [2025-03-16 20:02:29,833 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:29" (1/1) ... [2025-03-16 20:02:29,870 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:29" (1/1) ... [2025-03-16 20:02:29,892 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:29" (1/1) ... [2025-03-16 20:02:29,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:29" (1/1) ... [2025-03-16 20:02:30,007 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:02:30,009 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:02:30,010 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:02:30,010 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:02:30,011 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:29" (1/1) ... [2025-03-16 20:02:30,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:02:30,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:02:30,045 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:02:30,048 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:02:30,063 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:02:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 20:02:30,064 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 20:02:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 20:02:30,064 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 20:02:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 20:02:30,064 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 20:02:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-16 20:02:30,064 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-16 20:02:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 20:02:30,064 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 20:02:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 20:02:30,064 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 20:02:30,064 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 20:02:30,064 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 20:02:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:02:30,065 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:02:30,065 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:02:30,160 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:02:30,162 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:02:36,227 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 20:02:36,228 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 20:02:36,229 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 20:02:36,229 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 20:02:36,230 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 20:02:36,230 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 20:02:36,231 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 20:02:36,443 INFO L? ?]: Removed 1729 outVars from TransFormulas that were not future-live. [2025-03-16 20:02:36,444 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:02:36,501 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:02:36,502 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:02:36,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:02:36 BoogieIcfgContainer [2025-03-16 20:02:36,502 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:02:36,503 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:02:36,504 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:02:36,508 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:02:36,509 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:02:27" (1/3) ... [2025-03-16 20:02:36,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcff3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:02:36, skipping insertion in model container [2025-03-16 20:02:36,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:02:29" (2/3) ... [2025-03-16 20:02:36,510 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fcff3ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:02:36, skipping insertion in model container [2025-03-16 20:02:36,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:02:36" (3/3) ... [2025-03-16 20:02:36,511 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.09.cil-2.c [2025-03-16 20:02:36,522 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:02:36,524 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label45+token_ring.09.cil-2.c that has 8 procedures, 2421 locations, 1 initial locations, 13 loop locations, and 2 error locations. [2025-03-16 20:02:36,608 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:02:36,616 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;@32d7222e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:02:36,616 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:02:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand has 2421 states, 2387 states have (on average 1.8684541265186427) internal successors, (4460), 2391 states have internal predecessors, (4460), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-03-16 20:02:36,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:02:36,635 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:36,636 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] [2025-03-16 20:02:36,636 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:36,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:36,640 INFO L85 PathProgramCache]: Analyzing trace with hash 2045722081, now seen corresponding path program 1 times [2025-03-16 20:02:36,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:36,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995264970] [2025-03-16 20:02:36,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:36,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:36,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:02:36,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:02:36,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:36,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:37,228 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:02:37,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:37,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995264970] [2025-03-16 20:02:37,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995264970] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:37,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:37,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:02:37,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583725235] [2025-03-16 20:02:37,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:37,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:02:37,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:37,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:02:37,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:37,259 INFO L87 Difference]: Start difference. First operand has 2421 states, 2387 states have (on average 1.8684541265186427) internal successors, (4460), 2391 states have internal predecessors, (4460), 25 states have call successors, (25), 7 states have call predecessors, (25), 7 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:37,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:37,999 INFO L93 Difference]: Finished difference Result 5143 states and 9525 transitions. [2025-03-16 20:02:38,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:02:38,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-16 20:02:38,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:38,027 INFO L225 Difference]: With dead ends: 5143 [2025-03-16 20:02:38,028 INFO L226 Difference]: Without dead ends: 2729 [2025-03-16 20:02:38,040 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:02:38,042 INFO L435 NwaCegarLoop]: 4336 mSDtfsCounter, 4841 mSDsluCounter, 8875 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4858 SdHoareTripleChecker+Valid, 13211 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:38,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4858 Valid, 13211 Invalid, 538 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [54 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:02:38,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2729 states. [2025-03-16 20:02:38,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2729 to 2704. [2025-03-16 20:02:38,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2646 states have (on average 1.81708238851096) internal successors, (4808), 2650 states have internal predecessors, (4808), 43 states have call successors, (43), 13 states have call predecessors, (43), 13 states have return successors, (42), 41 states have call predecessors, (42), 41 states have call successors, (42) [2025-03-16 20:02:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 4893 transitions. [2025-03-16 20:02:38,194 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 4893 transitions. Word has length 132 [2025-03-16 20:02:38,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:38,195 INFO L471 AbstractCegarLoop]: Abstraction has 2704 states and 4893 transitions. [2025-03-16 20:02:38,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 4 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:38,195 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 4893 transitions. [2025-03-16 20:02:38,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:02:38,202 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:38,202 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] [2025-03-16 20:02:38,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:02:38,203 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:38,203 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:38,203 INFO L85 PathProgramCache]: Analyzing trace with hash -1762981729, now seen corresponding path program 1 times [2025-03-16 20:02:38,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:38,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477964178] [2025-03-16 20:02:38,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:38,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:38,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:02:38,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:02:38,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:38,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:38,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:02:38,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:38,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477964178] [2025-03-16 20:02:38,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477964178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:38,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:38,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:38,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073405082] [2025-03-16 20:02:38,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:38,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:38,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:38,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:38,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:38,455 INFO L87 Difference]: Start difference. First operand 2704 states and 4893 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:39,194 INFO L93 Difference]: Finished difference Result 3641 states and 6416 transitions. [2025-03-16 20:02:39,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:39,194 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-16 20:02:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:39,211 INFO L225 Difference]: With dead ends: 3641 [2025-03-16 20:02:39,211 INFO L226 Difference]: Without dead ends: 3073 [2025-03-16 20:02:39,214 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:02:39,215 INFO L435 NwaCegarLoop]: 4581 mSDtfsCounter, 4835 mSDsluCounter, 13769 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4852 SdHoareTripleChecker+Valid, 18350 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:39,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4852 Valid, 18350 Invalid, 890 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [31 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-16 20:02:39,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073 states. [2025-03-16 20:02:39,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073 to 2972. [2025-03-16 20:02:39,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2972 states, 2889 states have (on average 1.7978539286950501) internal successors, (5194), 2894 states have internal predecessors, (5194), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (63), 60 states have call predecessors, (63), 59 states have call successors, (63) [2025-03-16 20:02:39,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2972 states to 2972 states and 5318 transitions. [2025-03-16 20:02:39,323 INFO L78 Accepts]: Start accepts. Automaton has 2972 states and 5318 transitions. Word has length 132 [2025-03-16 20:02:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:39,323 INFO L471 AbstractCegarLoop]: Abstraction has 2972 states and 5318 transitions. [2025-03-16 20:02:39,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:39,325 INFO L276 IsEmpty]: Start isEmpty. Operand 2972 states and 5318 transitions. [2025-03-16 20:02:39,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:02:39,327 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:39,327 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] [2025-03-16 20:02:39,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:02:39,327 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:39,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:39,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1527303554, now seen corresponding path program 1 times [2025-03-16 20:02:39,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:39,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029117221] [2025-03-16 20:02:39,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:39,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:39,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:02:39,354 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:02:39,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:39,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:39,519 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:02:39,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:39,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029117221] [2025-03-16 20:02:39,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029117221] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:39,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:39,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:39,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657041588] [2025-03-16 20:02:39,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:39,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:39,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:39,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:39,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:39,522 INFO L87 Difference]: Start difference. First operand 2972 states and 5318 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:40,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:40,186 INFO L93 Difference]: Finished difference Result 4494 states and 7788 transitions. [2025-03-16 20:02:40,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:40,186 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-16 20:02:40,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:40,201 INFO L225 Difference]: With dead ends: 4494 [2025-03-16 20:02:40,202 INFO L226 Difference]: Without dead ends: 3658 [2025-03-16 20:02:40,206 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:02:40,207 INFO L435 NwaCegarLoop]: 4577 mSDtfsCounter, 4830 mSDsluCounter, 13757 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4847 SdHoareTripleChecker+Valid, 18334 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:40,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4847 Valid, 18334 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:02:40,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3658 states. [2025-03-16 20:02:40,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3658 to 3543. [2025-03-16 20:02:40,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3543 states, 3408 states have (on average 1.7690727699530517) internal successors, (6029), 3417 states have internal predecessors, (6029), 97 states have call successors, (97), 31 states have call predecessors, (97), 36 states have return successors, (111), 98 states have call predecessors, (111), 95 states have call successors, (111) [2025-03-16 20:02:40,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3543 states to 3543 states and 6237 transitions. [2025-03-16 20:02:40,313 INFO L78 Accepts]: Start accepts. Automaton has 3543 states and 6237 transitions. Word has length 132 [2025-03-16 20:02:40,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:40,314 INFO L471 AbstractCegarLoop]: Abstraction has 3543 states and 6237 transitions. [2025-03-16 20:02:40,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:40,314 INFO L276 IsEmpty]: Start isEmpty. Operand 3543 states and 6237 transitions. [2025-03-16 20:02:40,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:02:40,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:40,316 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] [2025-03-16 20:02:40,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:02:40,316 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:40,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:40,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1943982271, now seen corresponding path program 1 times [2025-03-16 20:02:40,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:40,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61780082] [2025-03-16 20:02:40,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:40,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:40,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:02:40,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:02:40,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:40,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:40,440 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:02:40,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:40,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61780082] [2025-03-16 20:02:40,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61780082] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:40,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:40,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:40,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834436542] [2025-03-16 20:02:40,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:40,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:40,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:40,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:40,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:40,442 INFO L87 Difference]: Start difference. First operand 3543 states and 6237 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:41,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:41,093 INFO L93 Difference]: Finished difference Result 6335 states and 10805 transitions. [2025-03-16 20:02:41,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:41,093 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-16 20:02:41,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:41,114 INFO L225 Difference]: With dead ends: 6335 [2025-03-16 20:02:41,114 INFO L226 Difference]: Without dead ends: 4928 [2025-03-16 20:02:41,119 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:02:41,121 INFO L435 NwaCegarLoop]: 4574 mSDtfsCounter, 4825 mSDsluCounter, 13748 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4842 SdHoareTripleChecker+Valid, 18322 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:41,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4842 Valid, 18322 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:02:41,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4928 states. [2025-03-16 20:02:41,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4928 to 4784. [2025-03-16 20:02:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4784 states, 4539 states have (on average 1.7354042740691782) internal successors, (7877), 4562 states have internal predecessors, (7877), 169 states have call successors, (169), 55 states have call predecessors, (169), 74 states have return successors, (231), 174 states have call predecessors, (231), 167 states have call successors, (231) [2025-03-16 20:02:41,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4784 states to 4784 states and 8277 transitions. [2025-03-16 20:02:41,257 INFO L78 Accepts]: Start accepts. Automaton has 4784 states and 8277 transitions. Word has length 132 [2025-03-16 20:02:41,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:41,258 INFO L471 AbstractCegarLoop]: Abstraction has 4784 states and 8277 transitions. [2025-03-16 20:02:41,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:41,258 INFO L276 IsEmpty]: Start isEmpty. Operand 4784 states and 8277 transitions. [2025-03-16 20:02:41,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:02:41,260 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:41,260 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] [2025-03-16 20:02:41,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:02:41,260 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:41,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:41,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1269176738, now seen corresponding path program 1 times [2025-03-16 20:02:41,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:41,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006853872] [2025-03-16 20:02:41,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:41,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:41,270 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:02:41,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:02:41,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:41,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:41,404 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:02:41,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:41,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006853872] [2025-03-16 20:02:41,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006853872] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:41,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:41,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:41,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179614158] [2025-03-16 20:02:41,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:41,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:41,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:41,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:41,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:41,407 INFO L87 Difference]: Start difference. First operand 4784 states and 8277 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:42,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:42,045 INFO L93 Difference]: Finished difference Result 10394 states and 17635 transitions. [2025-03-16 20:02:42,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:42,045 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-16 20:02:42,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:42,078 INFO L225 Difference]: With dead ends: 10394 [2025-03-16 20:02:42,078 INFO L226 Difference]: Without dead ends: 7746 [2025-03-16 20:02:42,089 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:02:42,090 INFO L435 NwaCegarLoop]: 4571 mSDtfsCounter, 4820 mSDsluCounter, 13739 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4837 SdHoareTripleChecker+Valid, 18310 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:42,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4837 Valid, 18310 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:02:42,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7746 states. [2025-03-16 20:02:42,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7746 to 7545. [2025-03-16 20:02:42,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7545 states, 7062 states have (on average 1.7095723591050693) internal successors, (12073), 7131 states have internal predecessors, (12073), 313 states have call successors, (313), 103 states have call predecessors, (313), 168 states have return successors, (567), 326 states have call predecessors, (567), 311 states have call successors, (567) [2025-03-16 20:02:42,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7545 states to 7545 states and 12953 transitions. [2025-03-16 20:02:42,333 INFO L78 Accepts]: Start accepts. Automaton has 7545 states and 12953 transitions. Word has length 132 [2025-03-16 20:02:42,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:42,334 INFO L471 AbstractCegarLoop]: Abstraction has 7545 states and 12953 transitions. [2025-03-16 20:02:42,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:42,334 INFO L276 IsEmpty]: Start isEmpty. Operand 7545 states and 12953 transitions. [2025-03-16 20:02:42,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:02:42,338 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:42,339 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] [2025-03-16 20:02:42,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:02:42,339 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:42,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:42,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1788469025, now seen corresponding path program 1 times [2025-03-16 20:02:42,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:42,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897253189] [2025-03-16 20:02:42,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:42,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:42,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:02:42,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:02:42,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:42,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:42,530 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:02:42,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:42,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897253189] [2025-03-16 20:02:42,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897253189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:42,530 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:42,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:42,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416718999] [2025-03-16 20:02:42,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:42,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:42,530 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:42,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:42,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:42,531 INFO L87 Difference]: Start difference. First operand 7545 states and 12953 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:43,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:43,207 INFO L93 Difference]: Finished difference Result 19569 states and 33661 transitions. [2025-03-16 20:02:43,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:43,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-16 20:02:43,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:43,260 INFO L225 Difference]: With dead ends: 19569 [2025-03-16 20:02:43,260 INFO L226 Difference]: Without dead ends: 14160 [2025-03-16 20:02:43,282 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:02:43,283 INFO L435 NwaCegarLoop]: 4568 mSDtfsCounter, 4815 mSDsluCounter, 13730 mSDsCounter, 0 mSdLazyCounter, 859 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4832 SdHoareTripleChecker+Valid, 18298 SdHoareTripleChecker+Invalid, 890 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 859 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:43,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4832 Valid, 18298 Invalid, 890 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 859 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:02:43,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14160 states. [2025-03-16 20:02:43,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14160 to 13850. [2025-03-16 20:02:43,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13850 states, 12837 states have (on average 1.7029679831736386) internal successors, (21861), 13052 states have internal predecessors, (21861), 601 states have call successors, (601), 199 states have call predecessors, (601), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-03-16 20:02:43,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13850 states to 13850 states and 24085 transitions. [2025-03-16 20:02:43,807 INFO L78 Accepts]: Start accepts. Automaton has 13850 states and 24085 transitions. Word has length 132 [2025-03-16 20:02:43,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:43,807 INFO L471 AbstractCegarLoop]: Abstraction has 13850 states and 24085 transitions. [2025-03-16 20:02:43,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:43,808 INFO L276 IsEmpty]: Start isEmpty. Operand 13850 states and 24085 transitions. [2025-03-16 20:02:43,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:02:43,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:43,828 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] [2025-03-16 20:02:43,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:02:43,828 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:43,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:43,828 INFO L85 PathProgramCache]: Analyzing trace with hash 1519915582, now seen corresponding path program 1 times [2025-03-16 20:02:43,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:43,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991805930] [2025-03-16 20:02:43,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:43,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:43,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:02:43,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:02:43,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:43,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:44,027 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:02:44,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:44,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991805930] [2025-03-16 20:02:44,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991805930] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:44,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:44,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:02:44,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771842225] [2025-03-16 20:02:44,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:44,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:02:44,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:44,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:02:44,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:44,029 INFO L87 Difference]: Start difference. First operand 13850 states and 24085 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:44,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:44,665 INFO L93 Difference]: Finished difference Result 28994 states and 51402 transitions. [2025-03-16 20:02:44,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:02:44,665 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-16 20:02:44,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:44,720 INFO L225 Difference]: With dead ends: 28994 [2025-03-16 20:02:44,720 INFO L226 Difference]: Without dead ends: 17280 [2025-03-16 20:02:44,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:44,747 INFO L435 NwaCegarLoop]: 4306 mSDtfsCounter, 4577 mSDsluCounter, 8483 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4594 SdHoareTripleChecker+Valid, 12789 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:44,748 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4594 Valid, 12789 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 20:02:44,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17280 states. [2025-03-16 20:02:45,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17280 to 13850. [2025-03-16 20:02:45,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13850 states, 12837 states have (on average 1.700397289086235) internal successors, (21828), 13052 states have internal predecessors, (21828), 601 states have call successors, (601), 199 states have call predecessors, (601), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-03-16 20:02:45,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13850 states to 13850 states and 24052 transitions. [2025-03-16 20:02:45,137 INFO L78 Accepts]: Start accepts. Automaton has 13850 states and 24052 transitions. Word has length 132 [2025-03-16 20:02:45,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:45,137 INFO L471 AbstractCegarLoop]: Abstraction has 13850 states and 24052 transitions. [2025-03-16 20:02:45,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:45,138 INFO L276 IsEmpty]: Start isEmpty. Operand 13850 states and 24052 transitions. [2025-03-16 20:02:45,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:02:45,144 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:45,144 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] [2025-03-16 20:02:45,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:02:45,145 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:45,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:45,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1698498305, now seen corresponding path program 1 times [2025-03-16 20:02:45,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:45,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29451461] [2025-03-16 20:02:45,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:45,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:45,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:02:45,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:02:45,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:45,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:45,293 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:02:45,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:45,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29451461] [2025-03-16 20:02:45,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29451461] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:45,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:45,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:02:45,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251189658] [2025-03-16 20:02:45,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:45,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:02:45,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:45,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:02:45,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:45,294 INFO L87 Difference]: Start difference. First operand 13850 states and 24052 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:45,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:45,941 INFO L93 Difference]: Finished difference Result 28749 states and 50846 transitions. [2025-03-16 20:02:45,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:02:45,945 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-16 20:02:45,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:46,003 INFO L225 Difference]: With dead ends: 28749 [2025-03-16 20:02:46,003 INFO L226 Difference]: Without dead ends: 17035 [2025-03-16 20:02:46,039 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:02:46,040 INFO L435 NwaCegarLoop]: 4303 mSDtfsCounter, 4574 mSDsluCounter, 8478 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4591 SdHoareTripleChecker+Valid, 12781 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:46,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4591 Valid, 12781 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:02:46,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17035 states. [2025-03-16 20:02:46,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17035 to 13850. [2025-03-16 20:02:46,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13850 states, 12837 states have (on average 1.6978265949988316) internal successors, (21795), 13052 states have internal predecessors, (21795), 601 states have call successors, (601), 199 states have call predecessors, (601), 410 states have return successors, (1623), 630 states have call predecessors, (1623), 599 states have call successors, (1623) [2025-03-16 20:02:46,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13850 states to 13850 states and 24019 transitions. [2025-03-16 20:02:46,665 INFO L78 Accepts]: Start accepts. Automaton has 13850 states and 24019 transitions. Word has length 132 [2025-03-16 20:02:46,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:46,666 INFO L471 AbstractCegarLoop]: Abstraction has 13850 states and 24019 transitions. [2025-03-16 20:02:46,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 13850 states and 24019 transitions. [2025-03-16 20:02:46,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:02:46,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:46,674 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] [2025-03-16 20:02:46,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:02:46,674 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:46,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:46,675 INFO L85 PathProgramCache]: Analyzing trace with hash 137344542, now seen corresponding path program 1 times [2025-03-16 20:02:46,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:46,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389261078] [2025-03-16 20:02:46,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:46,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:46,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:02:46,695 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:02:46,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:46,696 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:46,791 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:02:46,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:46,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389261078] [2025-03-16 20:02:46,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389261078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:46,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:46,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:46,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127842857] [2025-03-16 20:02:46,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:46,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:46,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:46,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:46,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:46,793 INFO L87 Difference]: Start difference. First operand 13850 states and 24019 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:47,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:47,770 INFO L93 Difference]: Finished difference Result 41898 states and 74018 transitions. [2025-03-16 20:02:47,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:47,771 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-16 20:02:47,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:47,865 INFO L225 Difference]: With dead ends: 41898 [2025-03-16 20:02:47,865 INFO L226 Difference]: Without dead ends: 30184 [2025-03-16 20:02:47,892 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:02:47,892 INFO L435 NwaCegarLoop]: 4549 mSDtfsCounter, 5045 mSDsluCounter, 13672 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5072 SdHoareTripleChecker+Valid, 18221 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:47,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5072 Valid, 18221 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:02:47,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30184 states. [2025-03-16 20:02:48,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30184 to 27822. [2025-03-16 20:02:48,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27822 states, 25619 states have (on average 1.7040868105702798) internal successors, (43657), 26288 states have internal predecessors, (43657), 1145 states have call successors, (1145), 391 states have call predecessors, (1145), 1056 states have return successors, (5239), 1206 states have call predecessors, (5239), 1143 states have call successors, (5239) [2025-03-16 20:02:48,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27822 states to 27822 states and 50041 transitions. [2025-03-16 20:02:48,720 INFO L78 Accepts]: Start accepts. Automaton has 27822 states and 50041 transitions. Word has length 132 [2025-03-16 20:02:48,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:48,721 INFO L471 AbstractCegarLoop]: Abstraction has 27822 states and 50041 transitions. [2025-03-16 20:02:48,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:48,721 INFO L276 IsEmpty]: Start isEmpty. Operand 27822 states and 50041 transitions. [2025-03-16 20:02:48,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:02:48,730 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:48,731 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] [2025-03-16 20:02:48,731 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:02:48,731 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:48,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:48,736 INFO L85 PathProgramCache]: Analyzing trace with hash 831991549, now seen corresponding path program 1 times [2025-03-16 20:02:48,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:48,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976828533] [2025-03-16 20:02:48,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:48,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:48,745 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:02:48,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:02:48,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:48,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:48,828 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:02:48,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:48,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976828533] [2025-03-16 20:02:48,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976828533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:48,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:48,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:02:48,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044918178] [2025-03-16 20:02:48,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:48,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:02:48,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:48,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:02:48,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:48,830 INFO L87 Difference]: Start difference. First operand 27822 states and 50041 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:50,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:50,076 INFO L93 Difference]: Finished difference Result 60818 states and 112752 transitions. [2025-03-16 20:02:50,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:02:50,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-16 20:02:50,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:50,232 INFO L225 Difference]: With dead ends: 60818 [2025-03-16 20:02:50,233 INFO L226 Difference]: Without dead ends: 35132 [2025-03-16 20:02:50,310 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:02:50,311 INFO L435 NwaCegarLoop]: 4296 mSDtfsCounter, 4567 mSDsluCounter, 8463 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4584 SdHoareTripleChecker+Valid, 12759 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:50,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4584 Valid, 12759 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:02:50,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35132 states. [2025-03-16 20:02:51,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35132 to 27822. [2025-03-16 20:02:51,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27822 states, 25619 states have (on average 1.7015496311331433) internal successors, (43592), 26288 states have internal predecessors, (43592), 1145 states have call successors, (1145), 391 states have call predecessors, (1145), 1056 states have return successors, (5239), 1206 states have call predecessors, (5239), 1143 states have call successors, (5239) [2025-03-16 20:02:51,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27822 states to 27822 states and 49976 transitions. [2025-03-16 20:02:51,861 INFO L78 Accepts]: Start accepts. Automaton has 27822 states and 49976 transitions. Word has length 132 [2025-03-16 20:02:51,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:51,863 INFO L471 AbstractCegarLoop]: Abstraction has 27822 states and 49976 transitions. [2025-03-16 20:02:51,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:51,863 INFO L276 IsEmpty]: Start isEmpty. Operand 27822 states and 49976 transitions. [2025-03-16 20:02:51,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:02:51,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:51,873 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] [2025-03-16 20:02:51,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:02:51,873 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:51,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:51,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1962778174, now seen corresponding path program 1 times [2025-03-16 20:02:51,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:51,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378577437] [2025-03-16 20:02:51,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:51,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:51,885 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:02:51,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:02:51,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:51,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:51,988 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:02:51,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:51,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378577437] [2025-03-16 20:02:51,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378577437] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:51,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:51,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:02:51,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6468006] [2025-03-16 20:02:51,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:51,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:02:51,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:51,990 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:02:51,990 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:02:51,991 INFO L87 Difference]: Start difference. First operand 27822 states and 49976 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:54,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:02:54,007 INFO L93 Difference]: Finished difference Result 89008 states and 166579 transitions. [2025-03-16 20:02:54,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 20:02:54,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-16 20:02:54,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:02:54,270 INFO L225 Difference]: With dead ends: 89008 [2025-03-16 20:02:54,270 INFO L226 Difference]: Without dead ends: 63322 [2025-03-16 20:02:54,344 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:02:54,345 INFO L435 NwaCegarLoop]: 4541 mSDtfsCounter, 4978 mSDsluCounter, 13649 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5005 SdHoareTripleChecker+Valid, 18190 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 20:02:54,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5005 Valid, 18190 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 20:02:54,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63322 states. [2025-03-16 20:02:57,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63322 to 59558. [2025-03-16 20:02:57,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59558 states, 54521 states have (on average 1.7144586489609508) internal successors, (93474), 56584 states have internal predecessors, (93474), 2201 states have call successors, (2201), 775 states have call predecessors, (2201), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-03-16 20:02:57,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59558 states to 59558 states and 114258 transitions. [2025-03-16 20:02:57,709 INFO L78 Accepts]: Start accepts. Automaton has 59558 states and 114258 transitions. Word has length 132 [2025-03-16 20:02:57,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:02:57,709 INFO L471 AbstractCegarLoop]: Abstraction has 59558 states and 114258 transitions. [2025-03-16 20:02:57,710 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:02:57,710 INFO L276 IsEmpty]: Start isEmpty. Operand 59558 states and 114258 transitions. [2025-03-16 20:02:57,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:02:57,727 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:02:57,727 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] [2025-03-16 20:02:57,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:02:57,727 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:02:57,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:02:57,728 INFO L85 PathProgramCache]: Analyzing trace with hash 1029423837, now seen corresponding path program 1 times [2025-03-16 20:02:57,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:02:57,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690231435] [2025-03-16 20:02:57,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:02:57,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:02:57,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:02:57,743 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:02:57,743 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:02:57,743 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:02:57,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:02:57,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:02:57,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690231435] [2025-03-16 20:02:57,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690231435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:02:57,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:02:57,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:02:57,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242728650] [2025-03-16 20:02:57,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:02:57,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:02:57,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:02:57,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:02:57,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:02:57,821 INFO L87 Difference]: Start difference. First operand 59558 states and 114258 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:03:00,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:00,563 INFO L93 Difference]: Finished difference Result 134492 states and 269632 transitions. [2025-03-16 20:03:00,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:03:00,564 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-16 20:03:00,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:00,984 INFO L225 Difference]: With dead ends: 134492 [2025-03-16 20:03:00,984 INFO L226 Difference]: Without dead ends: 77070 [2025-03-16 20:03:01,194 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:03:01,195 INFO L435 NwaCegarLoop]: 4291 mSDtfsCounter, 4563 mSDsluCounter, 8454 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4580 SdHoareTripleChecker+Valid, 12745 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:01,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4580 Valid, 12745 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:03:01,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77070 states. [2025-03-16 20:03:04,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77070 to 59558. [2025-03-16 20:03:04,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59558 states, 54521 states have (on average 1.7120925881770328) internal successors, (93345), 56584 states have internal predecessors, (93345), 2201 states have call successors, (2201), 775 states have call predecessors, (2201), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-03-16 20:03:04,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59558 states to 59558 states and 114129 transitions. [2025-03-16 20:03:05,013 INFO L78 Accepts]: Start accepts. Automaton has 59558 states and 114129 transitions. Word has length 132 [2025-03-16 20:03:05,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:05,014 INFO L471 AbstractCegarLoop]: Abstraction has 59558 states and 114129 transitions. [2025-03-16 20:03:05,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:03:05,014 INFO L276 IsEmpty]: Start isEmpty. Operand 59558 states and 114129 transitions. [2025-03-16 20:03:05,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:03:05,035 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:05,035 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] [2025-03-16 20:03:05,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:03:05,035 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:05,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:05,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1771631010, now seen corresponding path program 1 times [2025-03-16 20:03:05,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:05,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499140628] [2025-03-16 20:03:05,036 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:05,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:05,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:03:05,053 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:03:05,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:05,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:05,131 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:03:05,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:05,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499140628] [2025-03-16 20:03:05,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499140628] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:05,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:05,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:03:05,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778873826] [2025-03-16 20:03:05,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:05,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:03:05,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:05,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:03:05,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:03:05,132 INFO L87 Difference]: Start difference. First operand 59558 states and 114129 transitions. Second operand has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:03:08,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:03:08,603 INFO L93 Difference]: Finished difference Result 132303 states and 264996 transitions. [2025-03-16 20:03:08,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:03:08,604 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-16 20:03:08,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:03:08,987 INFO L225 Difference]: With dead ends: 132303 [2025-03-16 20:03:08,987 INFO L226 Difference]: Without dead ends: 74881 [2025-03-16 20:03:09,169 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:03:09,170 INFO L435 NwaCegarLoop]: 4288 mSDtfsCounter, 4560 mSDsluCounter, 8449 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4577 SdHoareTripleChecker+Valid, 12737 SdHoareTripleChecker+Invalid, 380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:03:09,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4577 Valid, 12737 Invalid, 380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:03:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74881 states. [2025-03-16 20:03:12,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74881 to 59558. [2025-03-16 20:03:12,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59558 states, 54521 states have (on average 1.7097265273931146) internal successors, (93216), 56584 states have internal predecessors, (93216), 2201 states have call successors, (2201), 775 states have call predecessors, (2201), 2834 states have return successors, (18583), 2326 states have call predecessors, (18583), 2199 states have call successors, (18583) [2025-03-16 20:03:12,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59558 states to 59558 states and 114000 transitions. [2025-03-16 20:03:12,747 INFO L78 Accepts]: Start accepts. Automaton has 59558 states and 114000 transitions. Word has length 132 [2025-03-16 20:03:12,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:03:12,747 INFO L471 AbstractCegarLoop]: Abstraction has 59558 states and 114000 transitions. [2025-03-16 20:03:12,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.2) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 20:03:12,747 INFO L276 IsEmpty]: Start isEmpty. Operand 59558 states and 114000 transitions. [2025-03-16 20:03:12,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-16 20:03:12,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:03:12,764 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] [2025-03-16 20:03:12,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:03:12,764 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:03:12,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:03:12,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1324601021, now seen corresponding path program 1 times [2025-03-16 20:03:12,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:03:12,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350002252] [2025-03-16 20:03:12,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:03:12,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:03:12,773 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-16 20:03:12,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-16 20:03:12,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:03:12,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:03:12,857 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:03:12,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:03:12,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350002252] [2025-03-16 20:03:12,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350002252] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:03:12,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:03:12,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:03:12,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87256605] [2025-03-16 20:03:12,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:03:12,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:03:12,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:03:12,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:03:12,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:03:12,859 INFO L87 Difference]: Start difference. First operand 59558 states and 114000 transitions. Second operand has 6 states, 6 states have (on average 20.166666666666668) internal successors, (121), 5 states have internal predecessors, (121), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)