./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label41+token_ring.08.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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_label41+token_ring.08.cil-1.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 b5a8b3103e2d9faed499388786efbacaa303edd9c4d157d09b07735fe300c357 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:48:09,113 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:48:09,183 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:48:09,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:48:09,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:48:09,220 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:48:09,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:48:09,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:48:09,225 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:48:09,225 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:48:09,225 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:48:09,225 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:48:09,226 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:48:09,226 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:48:09,226 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:48:09,226 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:48:09,226 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:48:09,226 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:48:09,226 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:48:09,226 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:48:09,226 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:48:09,226 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:48:09,226 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:48:09,226 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:48:09,226 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:48:09,226 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:48:09,227 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:48:09,227 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:48:09,227 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:48:09,227 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:48:09,227 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:48:09,227 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:48:09,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:48:09,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:48:09,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:48:09,227 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:48:09,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:48:09,227 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:48:09,227 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:48:09,227 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:48:09,227 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:48:09,227 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:48:09,227 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:48:09,227 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 -> b5a8b3103e2d9faed499388786efbacaa303edd9c4d157d09b07735fe300c357 [2025-03-08 06:48:09,463 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:48:09,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:48:09,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:48:09,474 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:48:09,475 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:48:09,476 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label41+token_ring.08.cil-1.c [2025-03-08 06:48:10,667 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a49c92a/6a550feaca2f4bc1a9cda1edb32527cc/FLAG7560f1a4d [2025-03-08 06:48:11,158 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:48:11,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label41+token_ring.08.cil-1.c [2025-03-08 06:48:11,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a49c92a/6a550feaca2f4bc1a9cda1edb32527cc/FLAG7560f1a4d [2025-03-08 06:48:11,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/30a49c92a/6a550feaca2f4bc1a9cda1edb32527cc [2025-03-08 06:48:11,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:48:11,239 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:48:11,240 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:48:11,240 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:48:11,246 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:48:11,246 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:48:11" (1/1) ... [2025-03-08 06:48:11,247 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@937d05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:48:11, skipping insertion in model container [2025-03-08 06:48:11,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:48:11" (1/1) ... [2025-03-08 06:48:11,367 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:48:12,380 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_label41+token_ring.08.cil-1.c[376251,376264] [2025-03-08 06:48:12,418 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_label41+token_ring.08.cil-1.c[383339,383352] [2025-03-08 06:48:12,683 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:48:12,691 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:48:13,292 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_label41+token_ring.08.cil-1.c[376251,376264] [2025-03-08 06:48:13,298 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_label41+token_ring.08.cil-1.c[383339,383352] [2025-03-08 06:48:13,309 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:48:13,392 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:48:13,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:48:13 WrapperNode [2025-03-08 06:48:13,393 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:48:13,394 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:48:13,394 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:48:13,394 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:48:13,399 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:48:13" (1/1) ... [2025-03-08 06:48:13,464 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:48:13" (1/1) ... [2025-03-08 06:48:13,787 INFO L138 Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12957 [2025-03-08 06:48:13,787 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:48:13,788 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:48:13,788 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:48:13,788 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:48:13,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:48:13" (1/1) ... [2025-03-08 06:48:13,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:48:13" (1/1) ... [2025-03-08 06:48:13,901 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:48:13" (1/1) ... [2025-03-08 06:48:14,011 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-08 06:48:14,012 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:48:13" (1/1) ... [2025-03-08 06:48:14,012 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:48:13" (1/1) ... [2025-03-08 06:48:14,247 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:48:13" (1/1) ... [2025-03-08 06:48:14,265 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:48:13" (1/1) ... [2025-03-08 06:48:14,283 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:48:13" (1/1) ... [2025-03-08 06:48:14,300 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:48:13" (1/1) ... [2025-03-08 06:48:14,348 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:48:14,350 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:48:14,351 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:48:14,351 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:48:14,352 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:48:13" (1/1) ... [2025-03-08 06:48:14,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:48:14,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:48:14,385 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-08 06:48:14,391 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-08 06:48:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:48:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:48:14,408 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:48:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:48:14,408 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:48:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:48:14,408 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:48:14,408 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:48:14,408 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:48:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:48:14,409 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:48:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:48:14,409 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:48:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:48:14,409 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:48:14,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:48:14,510 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:48:14,511 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:48:20,993 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:48:20,993 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:48:20,994 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:48:20,994 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:48:20,994 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:48:20,994 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:48:20,994 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:48:21,304 INFO L? ?]: Removed 1731 outVars from TransFormulas that were not future-live. [2025-03-08 06:48:21,305 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:48:21,365 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:48:21,365 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:48:21,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:48:21 BoogieIcfgContainer [2025-03-08 06:48:21,366 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:48:21,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:48:21,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:48:21,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:48:21,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:48:11" (1/3) ... [2025-03-08 06:48:21,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae2f96b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:48:21, skipping insertion in model container [2025-03-08 06:48:21,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:48:13" (2/3) ... [2025-03-08 06:48:21,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ae2f96b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:48:21, skipping insertion in model container [2025-03-08 06:48:21,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:48:21" (3/3) ... [2025-03-08 06:48:21,376 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label41+token_ring.08.cil-1.c [2025-03-08 06:48:21,389 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:48:21,392 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label41+token_ring.08.cil-1.c that has 7 procedures, 2463 locations, 1 initial locations, 12 loop locations, and 2 error locations. [2025-03-08 06:48:21,497 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:48:21,508 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;@560b01e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:48:21,509 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:48:21,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 2463 states, 2433 states have (on average 1.843403205918619) internal successors, (4485), 2435 states have internal predecessors, (4485), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-08 06:48:21,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:48:21,535 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:48:21,536 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-08 06:48:21,536 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:48:21,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:48:21,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1059960243, now seen corresponding path program 1 times [2025-03-08 06:48:21,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:48:21,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164699890] [2025-03-08 06:48:21,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:48:21,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:48:21,626 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:48:21,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:48:21,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:48:21,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:48:22,028 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-08 06:48:22,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:48:22,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164699890] [2025-03-08 06:48:22,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164699890] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:48:22,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:48:22,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:48:22,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114013876] [2025-03-08 06:48:22,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:48:22,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:48:22,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:48:22,059 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:48:22,059 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:48:22,067 INFO L87 Difference]: Start difference. First operand has 2463 states, 2433 states have (on average 1.843403205918619) internal successors, (4485), 2435 states have internal predecessors, (4485), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:22,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:48:22,763 INFO L93 Difference]: Finished difference Result 5204 states and 9513 transitions. [2025-03-08 06:48:22,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:48:22,765 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-08 06:48:22,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:48:22,794 INFO L225 Difference]: With dead ends: 5204 [2025-03-08 06:48:22,795 INFO L226 Difference]: Without dead ends: 2687 [2025-03-08 06:48:22,807 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-08 06:48:22,810 INFO L435 NwaCegarLoop]: 4360 mSDtfsCounter, 4834 mSDsluCounter, 8899 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4850 SdHoareTripleChecker+Valid, 13259 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:48:22,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4850 Valid, 13259 Invalid, 516 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:48:22,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2687 states. [2025-03-08 06:48:22,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2687 to 2666. [2025-03-08 06:48:22,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2666 states, 2612 states have (on average 1.812021439509954) internal successors, (4733), 2615 states have internal predecessors, (4733), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-08 06:48:22,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2666 states and 4812 transitions. [2025-03-08 06:48:22,979 INFO L78 Accepts]: Start accepts. Automaton has 2666 states and 4812 transitions. Word has length 132 [2025-03-08 06:48:22,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:48:22,979 INFO L471 AbstractCegarLoop]: Abstraction has 2666 states and 4812 transitions. [2025-03-08 06:48:22,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:22,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4812 transitions. [2025-03-08 06:48:22,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:48:22,987 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:48:22,988 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:48:22,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:48:22,989 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:48:22,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:48:22,990 INFO L85 PathProgramCache]: Analyzing trace with hash -618390513, now seen corresponding path program 1 times [2025-03-08 06:48:22,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:48:22,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693355075] [2025-03-08 06:48:22,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:48:22,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:48:23,062 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:48:23,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:48:23,073 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:48:23,073 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:48:23,280 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-08 06:48:23,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:48:23,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693355075] [2025-03-08 06:48:23,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693355075] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:48:23,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:48:23,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:48:23,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826719911] [2025-03-08 06:48:23,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:48:23,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:48:23,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:48:23,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:48:23,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:48:23,283 INFO L87 Difference]: Start difference. First operand 2666 states and 4812 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:23,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:48:23,611 INFO L93 Difference]: Finished difference Result 3249 states and 5745 transitions. [2025-03-08 06:48:23,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:48:23,612 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-08 06:48:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:48:23,622 INFO L225 Difference]: With dead ends: 3249 [2025-03-08 06:48:23,622 INFO L226 Difference]: Without dead ends: 2720 [2025-03-08 06:48:23,624 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-08 06:48:23,625 INFO L435 NwaCegarLoop]: 4279 mSDtfsCounter, 4533 mSDsluCounter, 8443 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4549 SdHoareTripleChecker+Valid, 12722 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:48:23,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4549 Valid, 12722 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:48:23,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2025-03-08 06:48:23,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2666. [2025-03-08 06:48:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2666 states, 2612 states have (on average 1.8112557427258806) internal successors, (4731), 2615 states have internal predecessors, (4731), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-08 06:48:23,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2666 states to 2666 states and 4810 transitions. [2025-03-08 06:48:23,685 INFO L78 Accepts]: Start accepts. Automaton has 2666 states and 4810 transitions. Word has length 132 [2025-03-08 06:48:23,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:48:23,685 INFO L471 AbstractCegarLoop]: Abstraction has 2666 states and 4810 transitions. [2025-03-08 06:48:23,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:23,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2666 states and 4810 transitions. [2025-03-08 06:48:23,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:48:23,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:48:23,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:48:23,691 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:48:23,691 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:48:23,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:48:23,691 INFO L85 PathProgramCache]: Analyzing trace with hash -382712338, now seen corresponding path program 1 times [2025-03-08 06:48:23,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:48:23,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338662831] [2025-03-08 06:48:23,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:48:23,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:48:23,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:48:23,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:48:23,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:48:23,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:48:23,869 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-08 06:48:23,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:48:23,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338662831] [2025-03-08 06:48:23,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338662831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:48:23,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:48:23,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:48:23,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185728463] [2025-03-08 06:48:23,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:48:23,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:48:23,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:48:23,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:48:23,871 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:48:23,871 INFO L87 Difference]: Start difference. First operand 2666 states and 4810 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:48:24,460 INFO L93 Difference]: Finished difference Result 3534 states and 6188 transitions. [2025-03-08 06:48:24,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:48:24,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-08 06:48:24,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:48:24,476 INFO L225 Difference]: With dead ends: 3534 [2025-03-08 06:48:24,476 INFO L226 Difference]: Without dead ends: 3005 [2025-03-08 06:48:24,479 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-08 06:48:24,480 INFO L435 NwaCegarLoop]: 4508 mSDtfsCounter, 4761 mSDsluCounter, 13543 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4777 SdHoareTripleChecker+Valid, 18051 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:48:24,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4777 Valid, 18051 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:48:24,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2025-03-08 06:48:24,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2916. [2025-03-08 06:48:24,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2916 states, 2838 states have (on average 1.7899929527836504) internal successors, (5080), 2842 states have internal predecessors, (5080), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (60), 57 states have call predecessors, (60), 56 states have call successors, (60) [2025-03-08 06:48:24,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2916 states to 2916 states and 5196 transitions. [2025-03-08 06:48:24,563 INFO L78 Accepts]: Start accepts. Automaton has 2916 states and 5196 transitions. Word has length 132 [2025-03-08 06:48:24,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:48:24,564 INFO L471 AbstractCegarLoop]: Abstraction has 2916 states and 5196 transitions. [2025-03-08 06:48:24,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:24,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2916 states and 5196 transitions. [2025-03-08 06:48:24,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:48:24,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:48:24,565 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-08 06:48:24,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:48:24,565 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:48:24,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:48:24,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1206393809, now seen corresponding path program 1 times [2025-03-08 06:48:24,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:48:24,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680078858] [2025-03-08 06:48:24,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:48:24,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:48:24,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:48:24,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:48:24,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:48:24,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:48:24,741 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-08 06:48:24,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:48:24,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680078858] [2025-03-08 06:48:24,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680078858] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:48:24,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:48:24,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:48:24,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977967851] [2025-03-08 06:48:24,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:48:24,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:48:24,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:48:24,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:48:24,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:48:24,744 INFO L87 Difference]: Start difference. First operand 2916 states and 5196 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:25,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:48:25,376 INFO L93 Difference]: Finished difference Result 4327 states and 7431 transitions. [2025-03-08 06:48:25,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:48:25,377 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-08 06:48:25,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:48:25,396 INFO L225 Difference]: With dead ends: 4327 [2025-03-08 06:48:25,396 INFO L226 Difference]: Without dead ends: 3548 [2025-03-08 06:48:25,401 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-08 06:48:25,403 INFO L435 NwaCegarLoop]: 4504 mSDtfsCounter, 4756 mSDsluCounter, 13531 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4772 SdHoareTripleChecker+Valid, 18035 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:48:25,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4772 Valid, 18035 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:48:25,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3548 states. [2025-03-08 06:48:25,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3548 to 3447. [2025-03-08 06:48:25,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3447 states, 3319 states have (on average 1.757457065381139) internal successors, (5833), 3327 states have internal predecessors, (5833), 90 states have call successors, (90), 30 states have call predecessors, (90), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-03-08 06:48:25,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 6029 transitions. [2025-03-08 06:48:25,527 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 6029 transitions. Word has length 132 [2025-03-08 06:48:25,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:48:25,528 INFO L471 AbstractCegarLoop]: Abstraction has 3447 states and 6029 transitions. [2025-03-08 06:48:25,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:25,528 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 6029 transitions. [2025-03-08 06:48:25,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:48:25,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:48:25,530 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-08 06:48:25,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:48:25,530 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:48:25,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:48:25,531 INFO L85 PathProgramCache]: Analyzing trace with hash -124585522, now seen corresponding path program 1 times [2025-03-08 06:48:25,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:48:25,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289782337] [2025-03-08 06:48:25,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:48:25,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:48:25,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:48:25,548 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:48:25,548 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:48:25,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:48:25,729 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-08 06:48:25,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:48:25,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289782337] [2025-03-08 06:48:25,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289782337] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:48:25,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:48:25,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:48:25,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220624995] [2025-03-08 06:48:25,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:48:25,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:48:25,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:48:25,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:48:25,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:48:25,731 INFO L87 Difference]: Start difference. First operand 3447 states and 6029 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:26,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:48:26,249 INFO L93 Difference]: Finished difference Result 6032 states and 10158 transitions. [2025-03-08 06:48:26,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:48:26,249 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-08 06:48:26,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:48:26,267 INFO L225 Difference]: With dead ends: 6032 [2025-03-08 06:48:26,267 INFO L226 Difference]: Without dead ends: 4722 [2025-03-08 06:48:26,271 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-08 06:48:26,272 INFO L435 NwaCegarLoop]: 4311 mSDtfsCounter, 4777 mSDsluCounter, 13075 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4793 SdHoareTripleChecker+Valid, 17386 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:48:26,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4793 Valid, 17386 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:48:26,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4722 states. [2025-03-08 06:48:26,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4722 to 4596. [2025-03-08 06:48:26,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4596 states, 4362 states have (on average 1.7177900045850527) internal successors, (7493), 4384 states have internal predecessors, (7493), 158 states have call successors, (158), 54 states have call predecessors, (158), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-03-08 06:48:26,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4596 states to 4596 states and 7873 transitions. [2025-03-08 06:48:26,405 INFO L78 Accepts]: Start accepts. Automaton has 4596 states and 7873 transitions. Word has length 132 [2025-03-08 06:48:26,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:48:26,405 INFO L471 AbstractCegarLoop]: Abstraction has 4596 states and 7873 transitions. [2025-03-08 06:48:26,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:26,405 INFO L276 IsEmpty]: Start isEmpty. Operand 4596 states and 7873 transitions. [2025-03-08 06:48:26,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:48:26,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:48:26,407 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-08 06:48:26,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:48:26,407 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:48:26,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:48:26,408 INFO L85 PathProgramCache]: Analyzing trace with hash -643877809, now seen corresponding path program 1 times [2025-03-08 06:48:26,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:48:26,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183394585] [2025-03-08 06:48:26,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:48:26,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:48:26,417 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:48:26,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:48:26,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:48:26,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:48:26,557 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-08 06:48:26,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:48:26,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183394585] [2025-03-08 06:48:26,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183394585] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:48:26,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:48:26,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:48:26,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90629331] [2025-03-08 06:48:26,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:48:26,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:48:26,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:48:26,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:48:26,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:48:26,559 INFO L87 Difference]: Start difference. First operand 4596 states and 7873 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:27,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:48:27,119 INFO L93 Difference]: Finished difference Result 9771 states and 16312 transitions. [2025-03-08 06:48:27,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:48:27,120 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-08 06:48:27,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:48:27,148 INFO L225 Difference]: With dead ends: 9771 [2025-03-08 06:48:27,148 INFO L226 Difference]: Without dead ends: 7312 [2025-03-08 06:48:27,156 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-08 06:48:27,157 INFO L435 NwaCegarLoop]: 4498 mSDtfsCounter, 4746 mSDsluCounter, 13513 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4762 SdHoareTripleChecker+Valid, 18011 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:48:27,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4762 Valid, 18011 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:48:27,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7312 states. [2025-03-08 06:48:27,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7312 to 7137. [2025-03-08 06:48:27,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7137 states, 6673 states have (on average 1.6845496778060842) internal successors, (11241), 6741 states have internal predecessors, (11241), 294 states have call successors, (294), 102 states have call predecessors, (294), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-03-08 06:48:27,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7137 states to 7137 states and 12085 transitions. [2025-03-08 06:48:27,357 INFO L78 Accepts]: Start accepts. Automaton has 7137 states and 12085 transitions. Word has length 132 [2025-03-08 06:48:27,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:48:27,358 INFO L471 AbstractCegarLoop]: Abstraction has 7137 states and 12085 transitions. [2025-03-08 06:48:27,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:27,359 INFO L276 IsEmpty]: Start isEmpty. Operand 7137 states and 12085 transitions. [2025-03-08 06:48:27,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:48:27,362 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:48:27,362 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-08 06:48:27,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:48:27,363 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:48:27,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:48:27,363 INFO L85 PathProgramCache]: Analyzing trace with hash -1630460498, now seen corresponding path program 1 times [2025-03-08 06:48:27,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:48:27,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849161449] [2025-03-08 06:48:27,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:48:27,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:48:27,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:48:27,374 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:48:27,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:48:27,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:48:27,468 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-08 06:48:27,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:48:27,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849161449] [2025-03-08 06:48:27,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849161449] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:48:27,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:48:27,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:48:27,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899172087] [2025-03-08 06:48:27,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:48:27,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:48:27,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:48:27,470 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:48:27,470 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:48:27,470 INFO L87 Difference]: Start difference. First operand 7137 states and 12085 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:28,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:48:28,194 INFO L93 Difference]: Finished difference Result 18162 states and 30698 transitions. [2025-03-08 06:48:28,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:48:28,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-08 06:48:28,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:48:28,257 INFO L225 Difference]: With dead ends: 18162 [2025-03-08 06:48:28,257 INFO L226 Difference]: Without dead ends: 13162 [2025-03-08 06:48:28,278 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-08 06:48:28,279 INFO L435 NwaCegarLoop]: 4495 mSDtfsCounter, 4741 mSDsluCounter, 13504 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4757 SdHoareTripleChecker+Valid, 17999 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:48:28,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4757 Valid, 17999 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:48:28,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13162 states. [2025-03-08 06:48:28,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13162 to 12894. [2025-03-08 06:48:28,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12894 states, 11916 states have (on average 1.6714501510574018) internal successors, (19917), 12130 states have internal predecessors, (19917), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-08 06:48:28,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12894 states to 12894 states and 22073 transitions. [2025-03-08 06:48:28,867 INFO L78 Accepts]: Start accepts. Automaton has 12894 states and 22073 transitions. Word has length 132 [2025-03-08 06:48:28,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:48:28,871 INFO L471 AbstractCegarLoop]: Abstraction has 12894 states and 22073 transitions. [2025-03-08 06:48:28,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:28,875 INFO L276 IsEmpty]: Start isEmpty. Operand 12894 states and 22073 transitions. [2025-03-08 06:48:28,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:48:28,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:48:28,893 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-08 06:48:28,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:48:28,893 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:48:28,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:48:28,894 INFO L85 PathProgramCache]: Analyzing trace with hash -553907089, now seen corresponding path program 1 times [2025-03-08 06:48:28,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:48:28,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852605215] [2025-03-08 06:48:28,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:48:28,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:48:28,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:48:28,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:48:28,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:48:28,927 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:48:29,139 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-08 06:48:29,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:48:29,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852605215] [2025-03-08 06:48:29,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852605215] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:48:29,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:48:29,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:48:29,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751650997] [2025-03-08 06:48:29,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:48:29,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:48:29,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:48:29,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:48:29,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:48:29,141 INFO L87 Difference]: Start difference. First operand 12894 states and 22073 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:29,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:48:29,817 INFO L93 Difference]: Finished difference Result 26591 states and 46398 transitions. [2025-03-08 06:48:29,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:48:29,818 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-08 06:48:29,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:48:29,870 INFO L225 Difference]: With dead ends: 26591 [2025-03-08 06:48:29,871 INFO L226 Difference]: Without dead ends: 15834 [2025-03-08 06:48:29,895 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-08 06:48:29,895 INFO L435 NwaCegarLoop]: 4266 mSDtfsCounter, 4525 mSDsluCounter, 8418 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4541 SdHoareTripleChecker+Valid, 12684 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:48:29,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4541 Valid, 12684 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:48:29,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15834 states. [2025-03-08 06:48:30,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15834 to 12894. [2025-03-08 06:48:30,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12894 states, 11916 states have (on average 1.6686807653575024) internal successors, (19884), 12130 states have internal predecessors, (19884), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-08 06:48:30,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12894 states to 12894 states and 22040 transitions. [2025-03-08 06:48:30,474 INFO L78 Accepts]: Start accepts. Automaton has 12894 states and 22040 transitions. Word has length 132 [2025-03-08 06:48:30,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:48:30,474 INFO L471 AbstractCegarLoop]: Abstraction has 12894 states and 22040 transitions. [2025-03-08 06:48:30,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:30,474 INFO L276 IsEmpty]: Start isEmpty. Operand 12894 states and 22040 transitions. [2025-03-08 06:48:30,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:48:30,482 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:48:30,482 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-08 06:48:30,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:48:30,482 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:48:30,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:48:30,483 INFO L85 PathProgramCache]: Analyzing trace with hash 1281935758, now seen corresponding path program 1 times [2025-03-08 06:48:30,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:48:30,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785977624] [2025-03-08 06:48:30,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:48:30,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:48:30,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:48:30,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:48:30,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:48:30,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:48:30,586 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-08 06:48:30,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:48:30,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785977624] [2025-03-08 06:48:30,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785977624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:48:30,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:48:30,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:48:30,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536990854] [2025-03-08 06:48:30,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:48:30,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:48:30,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:48:30,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:48:30,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:48:30,588 INFO L87 Difference]: Start difference. First operand 12894 states and 22040 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:31,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:48:31,277 INFO L93 Difference]: Finished difference Result 26346 states and 45842 transitions. [2025-03-08 06:48:31,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:48:31,278 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-08 06:48:31,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:48:31,336 INFO L225 Difference]: With dead ends: 26346 [2025-03-08 06:48:31,336 INFO L226 Difference]: Without dead ends: 15589 [2025-03-08 06:48:31,371 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-08 06:48:31,373 INFO L435 NwaCegarLoop]: 4263 mSDtfsCounter, 4522 mSDsluCounter, 8413 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4538 SdHoareTripleChecker+Valid, 12676 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:48:31,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4538 Valid, 12676 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:48:31,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15589 states. [2025-03-08 06:48:31,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15589 to 12894. [2025-03-08 06:48:31,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12894 states, 11916 states have (on average 1.6659113796576033) internal successors, (19851), 12130 states have internal predecessors, (19851), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-08 06:48:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12894 states to 12894 states and 22007 transitions. [2025-03-08 06:48:31,948 INFO L78 Accepts]: Start accepts. Automaton has 12894 states and 22007 transitions. Word has length 132 [2025-03-08 06:48:31,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:48:31,949 INFO L471 AbstractCegarLoop]: Abstraction has 12894 states and 22007 transitions. [2025-03-08 06:48:31,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:31,949 INFO L276 IsEmpty]: Start isEmpty. Operand 12894 states and 22007 transitions. [2025-03-08 06:48:31,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:48:31,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:48:31,956 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-08 06:48:31,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:48:31,957 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:48:31,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:48:31,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1341156495, now seen corresponding path program 1 times [2025-03-08 06:48:31,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:48:31,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011043593] [2025-03-08 06:48:31,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:48:31,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:48:31,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:48:31,975 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:48:31,975 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:48:31,975 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:48:32,084 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-08 06:48:32,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:48:32,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011043593] [2025-03-08 06:48:32,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011043593] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:48:32,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:48:32,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:48:32,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088385459] [2025-03-08 06:48:32,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:48:32,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:48:32,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:48:32,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:48:32,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:48:32,087 INFO L87 Difference]: Start difference. First operand 12894 states and 22007 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:33,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:48:33,139 INFO L93 Difference]: Finished difference Result 38865 states and 67435 transitions. [2025-03-08 06:48:33,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:48:33,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-08 06:48:33,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:48:33,236 INFO L225 Difference]: With dead ends: 38865 [2025-03-08 06:48:33,236 INFO L226 Difference]: Without dead ends: 28108 [2025-03-08 06:48:33,266 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-08 06:48:33,267 INFO L435 NwaCegarLoop]: 4480 mSDtfsCounter, 4974 mSDsluCounter, 13456 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4999 SdHoareTripleChecker+Valid, 17936 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:48:33,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4999 Valid, 17936 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:48:33,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28108 states. [2025-03-08 06:48:33,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28108 to 25689. [2025-03-08 06:48:33,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25689 states, 23553 states have (on average 1.669723602088906) internal successors, (39327), 24221 states have internal predecessors, (39327), 1078 states have call successors, (1078), 390 states have call predecessors, (1078), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-03-08 06:48:34,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25689 states to 25689 states and 45579 transitions. [2025-03-08 06:48:34,070 INFO L78 Accepts]: Start accepts. Automaton has 25689 states and 45579 transitions. Word has length 132 [2025-03-08 06:48:34,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:48:34,071 INFO L471 AbstractCegarLoop]: Abstraction has 25689 states and 45579 transitions. [2025-03-08 06:48:34,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:34,071 INFO L276 IsEmpty]: Start isEmpty. Operand 25689 states and 45579 transitions. [2025-03-08 06:48:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:48:34,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:48:34,080 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-08 06:48:34,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:48:34,080 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:48:34,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:48:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash 2035803502, now seen corresponding path program 1 times [2025-03-08 06:48:34,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:48:34,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021236685] [2025-03-08 06:48:34,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:48:34,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:48:34,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:48:34,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:48:34,093 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:48:34,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:48:34,163 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-08 06:48:34,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:48:34,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021236685] [2025-03-08 06:48:34,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1021236685] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:48:34,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:48:34,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:48:34,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414602079] [2025-03-08 06:48:34,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:48:34,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:48:34,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:48:34,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:48:34,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:48:34,164 INFO L87 Difference]: Start difference. First operand 25689 states and 45579 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:35,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:48:35,628 INFO L93 Difference]: Finished difference Result 55820 states and 102366 transitions. [2025-03-08 06:48:35,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:48:35,629 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-08 06:48:35,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:48:35,780 INFO L225 Difference]: With dead ends: 55820 [2025-03-08 06:48:35,780 INFO L226 Difference]: Without dead ends: 32268 [2025-03-08 06:48:35,855 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-08 06:48:35,855 INFO L435 NwaCegarLoop]: 4258 mSDtfsCounter, 4516 mSDsluCounter, 8402 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4532 SdHoareTripleChecker+Valid, 12660 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:48:35,855 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4532 Valid, 12660 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:48:35,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32268 states. [2025-03-08 06:48:37,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32268 to 25689. [2025-03-08 06:48:37,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25689 states, 23553 states have (on average 1.6669638687216066) internal successors, (39262), 24221 states have internal predecessors, (39262), 1078 states have call successors, (1078), 390 states have call predecessors, (1078), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-03-08 06:48:37,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25689 states to 25689 states and 45514 transitions. [2025-03-08 06:48:37,363 INFO L78 Accepts]: Start accepts. Automaton has 25689 states and 45514 transitions. Word has length 132 [2025-03-08 06:48:37,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:48:37,364 INFO L471 AbstractCegarLoop]: Abstraction has 25689 states and 45514 transitions. [2025-03-08 06:48:37,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 25689 states and 45514 transitions. [2025-03-08 06:48:37,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:48:37,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:48:37,373 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-08 06:48:37,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:48:37,373 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:48:37,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:48:37,374 INFO L85 PathProgramCache]: Analyzing trace with hash -1128377169, now seen corresponding path program 1 times [2025-03-08 06:48:37,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:48:37,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227097874] [2025-03-08 06:48:37,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:48:37,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:48:37,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:48:37,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:48:37,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:48:37,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:48:37,489 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-08 06:48:37,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:48:37,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227097874] [2025-03-08 06:48:37,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227097874] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:48:37,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:48:37,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:48:37,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861236118] [2025-03-08 06:48:37,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:48:37,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:48:37,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:48:37,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:48:37,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:48:37,492 INFO L87 Difference]: Start difference. First operand 25689 states and 45514 transitions. Second operand has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:39,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:48:39,641 INFO L93 Difference]: Finished difference Result 81894 states and 151450 transitions. [2025-03-08 06:48:39,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:48:39,642 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-08 06:48:39,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:48:39,978 INFO L225 Difference]: With dead ends: 81894 [2025-03-08 06:48:39,979 INFO L226 Difference]: Without dead ends: 58342 [2025-03-08 06:48:40,072 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-08 06:48:40,073 INFO L435 NwaCegarLoop]: 4472 mSDtfsCounter, 4901 mSDsluCounter, 13433 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4926 SdHoareTripleChecker+Valid, 17905 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:48:40,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4926 Valid, 17905 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:48:40,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58342 states. [2025-03-08 06:48:42,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58342 to 54585. [2025-03-08 06:48:43,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54585 states, 49679 states have (on average 1.678777753175386) internal successors, (83400), 51741 states have internal predecessors, (83400), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-08 06:48:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54585 states to 54585 states and 103924 transitions. [2025-03-08 06:48:43,278 INFO L78 Accepts]: Start accepts. Automaton has 54585 states and 103924 transitions. Word has length 132 [2025-03-08 06:48:43,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:48:43,279 INFO L471 AbstractCegarLoop]: Abstraction has 54585 states and 103924 transitions. [2025-03-08 06:48:43,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.333333333333332) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:43,279 INFO L276 IsEmpty]: Start isEmpty. Operand 54585 states and 103924 transitions. [2025-03-08 06:48:43,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:48:43,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:48:43,296 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-08 06:48:43,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:48:43,296 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:48:43,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:48:43,297 INFO L85 PathProgramCache]: Analyzing trace with hash -2061731506, now seen corresponding path program 1 times [2025-03-08 06:48:43,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:48:43,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996350898] [2025-03-08 06:48:43,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:48:43,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:48:43,303 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:48:43,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:48:43,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:48:43,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:48:43,356 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-08 06:48:43,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:48:43,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996350898] [2025-03-08 06:48:43,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996350898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:48:43,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:48:43,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:48:43,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112684680] [2025-03-08 06:48:43,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:48:43,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:48:43,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:48:43,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:48:43,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:48:43,357 INFO L87 Difference]: Start difference. First operand 54585 states and 103924 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:46,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:48:46,901 INFO L93 Difference]: Finished difference Result 122356 states and 244586 transitions. [2025-03-08 06:48:46,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:48:46,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-08 06:48:46,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:48:47,240 INFO L225 Difference]: With dead ends: 122356 [2025-03-08 06:48:47,240 INFO L226 Difference]: Without dead ends: 69908 [2025-03-08 06:48:47,376 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-08 06:48:47,376 INFO L435 NwaCegarLoop]: 4240 mSDtfsCounter, 4523 mSDsluCounter, 8380 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4539 SdHoareTripleChecker+Valid, 12620 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:48:47,376 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4539 Valid, 12620 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:48:47,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69908 states. [2025-03-08 06:48:49,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69908 to 54585. [2025-03-08 06:48:50,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54585 states, 49679 states have (on average 1.6761810825499708) internal successors, (83271), 51741 states have internal predecessors, (83271), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-08 06:48:50,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54585 states to 54585 states and 103795 transitions. [2025-03-08 06:48:50,248 INFO L78 Accepts]: Start accepts. Automaton has 54585 states and 103795 transitions. Word has length 132 [2025-03-08 06:48:50,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:48:50,249 INFO L471 AbstractCegarLoop]: Abstraction has 54585 states and 103795 transitions. [2025-03-08 06:48:50,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:50,249 INFO L276 IsEmpty]: Start isEmpty. Operand 54585 states and 103795 transitions. [2025-03-08 06:48:50,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 06:48:50,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:48:50,264 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:48:50,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:48:50,264 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:48:50,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:48:50,265 INFO L85 PathProgramCache]: Analyzing trace with hash -567819057, now seen corresponding path program 1 times [2025-03-08 06:48:50,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:48:50,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560578723] [2025-03-08 06:48:50,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:48:50,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:48:50,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 06:48:50,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 06:48:50,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:48:50,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:48:50,327 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-08 06:48:50,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:48:50,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560578723] [2025-03-08 06:48:50,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560578723] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:48:50,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:48:50,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:48:50,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443407701] [2025-03-08 06:48:50,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:48:50,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:48:50,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:48:50,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:48:50,329 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:48:50,329 INFO L87 Difference]: Start difference. First operand 54585 states and 103795 transitions. Second operand has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:48:53,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:48:53,643 INFO L93 Difference]: Finished difference Result 120167 states and 239950 transitions. [2025-03-08 06:48:53,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:48:53,644 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.4) internal successors, (122), 5 states have internal predecessors, (122), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 132 [2025-03-08 06:48:53,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:48:53,948 INFO L225 Difference]: With dead ends: 120167 [2025-03-08 06:48:53,948 INFO L226 Difference]: Without dead ends: 67719 [2025-03-08 06:48:54,282 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-08 06:48:54,283 INFO L435 NwaCegarLoop]: 4250 mSDtfsCounter, 4509 mSDsluCounter, 8388 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4525 SdHoareTripleChecker+Valid, 12638 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:48:54,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4525 Valid, 12638 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:48:54,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67719 states.