./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.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_label43+token_ring.07.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 54f1be55645106b43145d214f59b6f833268ce7c7f84e399c536bf03a2c9679b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:51:12,451 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:51:12,503 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:51:12,509 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:51:12,511 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:51:12,533 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:51:12,534 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:51:12,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:51:12,535 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:51:12,535 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:51:12,535 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:51:12,536 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:51:12,536 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:51:12,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:51:12,536 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:51:12,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:51:12,536 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:51:12,536 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:51:12,536 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:51:12,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:51:12,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:51:12,537 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:51:12,537 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:51:12,537 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:51:12,537 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:51:12,537 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:51:12,537 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:51:12,537 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:51:12,537 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:51:12,537 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:51:12,537 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:51:12,537 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:51:12,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:51:12,537 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:51:12,537 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:51:12,537 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:51:12,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:51:12,537 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:51:12,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:51:12,538 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:51:12,538 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:51:12,538 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:51:12,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:51:12,538 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 -> 54f1be55645106b43145d214f59b6f833268ce7c7f84e399c536bf03a2c9679b [2025-03-08 06:51:12,782 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:51:12,791 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:51:12,793 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:51:12,794 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:51:12,794 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:51:12,796 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-1.c [2025-03-08 06:51:14,054 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/974b5fec6/ed6352b75b404c5a9abb29080571fd9d/FLAG400976812 [2025-03-08 06:51:14,769 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:51:14,770 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.07.cil-1.c [2025-03-08 06:51:14,825 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/974b5fec6/ed6352b75b404c5a9abb29080571fd9d/FLAG400976812 [2025-03-08 06:51:15,116 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/974b5fec6/ed6352b75b404c5a9abb29080571fd9d [2025-03-08 06:51:15,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:51:15,120 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:51:15,121 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:51:15,121 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:51:15,124 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:51:15,125 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:51:15" (1/1) ... [2025-03-08 06:51:15,125 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69eed51d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:15, skipping insertion in model container [2025-03-08 06:51:15,126 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:51:15" (1/1) ... [2025-03-08 06:51:15,277 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:51:16,561 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_label43+token_ring.07.cil-1.c[381679,381692] [2025-03-08 06:51:16,613 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_label43+token_ring.07.cil-1.c[383339,383352] [2025-03-08 06:51:16,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:51:16,905 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:51:17,506 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_label43+token_ring.07.cil-1.c[381679,381692] [2025-03-08 06:51:17,511 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_label43+token_ring.07.cil-1.c[383339,383352] [2025-03-08 06:51:17,535 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:51:17,602 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:51:17,604 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:17 WrapperNode [2025-03-08 06:51:17,606 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:51:17,608 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:51:17,608 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:51:17,608 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:51:17,614 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:51:17" (1/1) ... [2025-03-08 06:51:17,701 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:51:17" (1/1) ... [2025-03-08 06:51:17,980 INFO L138 Inliner]: procedures = 58, calls = 62, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 12900 [2025-03-08 06:51:17,980 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:51:17,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:51:17,981 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:51:17,981 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:51:17,987 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:17" (1/1) ... [2025-03-08 06:51:17,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:17" (1/1) ... [2025-03-08 06:51:18,173 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:17" (1/1) ... [2025-03-08 06:51:18,295 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:51:18,295 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:17" (1/1) ... [2025-03-08 06:51:18,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:17" (1/1) ... [2025-03-08 06:51:18,429 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:17" (1/1) ... [2025-03-08 06:51:18,450 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:17" (1/1) ... [2025-03-08 06:51:18,475 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:17" (1/1) ... [2025-03-08 06:51:18,493 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:17" (1/1) ... [2025-03-08 06:51:18,540 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:51:18,542 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:51:18,542 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:51:18,543 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:51:18,543 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:17" (1/1) ... [2025-03-08 06:51:18,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:51:18,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:51:18,570 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:51:18,574 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:51:18,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:51:18,593 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:51:18,593 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:51:18,593 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:51:18,594 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:51:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:51:18,594 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:51:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:51:18,594 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:51:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:51:18,594 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:51:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:51:18,594 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:51:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:51:18,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:51:18,595 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:51:18,692 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:51:18,693 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:51:25,097 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:51:25,098 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:51:25,098 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:51:25,098 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:51:25,099 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:51:25,099 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:51:25,099 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:51:25,304 INFO L? ?]: Removed 1725 outVars from TransFormulas that were not future-live. [2025-03-08 06:51:25,305 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:51:25,360 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:51:25,360 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:51:25,360 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:51:25 BoogieIcfgContainer [2025-03-08 06:51:25,361 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:51:25,362 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:51:25,362 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:51:25,422 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:51:25,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:51:15" (1/3) ... [2025-03-08 06:51:25,427 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43570c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:51:25, skipping insertion in model container [2025-03-08 06:51:25,427 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:51:17" (2/3) ... [2025-03-08 06:51:25,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43570c18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:51:25, skipping insertion in model container [2025-03-08 06:51:25,432 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:51:25" (3/3) ... [2025-03-08 06:51:25,433 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.07.cil-1.c [2025-03-08 06:51:25,455 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:51:25,460 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.07.cil-1.c that has 7 procedures, 2438 locations, 1 initial locations, 11 loop locations, and 2 error locations. [2025-03-08 06:51:25,564 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:51:25,573 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;@31da03d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:51:25,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:51:25,585 INFO L276 IsEmpty]: Start isEmpty. Operand has 2438 states, 2409 states have (on average 1.8451639684516397) internal successors, (4445), 2411 states have internal predecessors, (4445), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 06:51:25,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:51:25,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:25,598 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] [2025-03-08 06:51:25,599 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:25,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:25,603 INFO L85 PathProgramCache]: Analyzing trace with hash 140385463, now seen corresponding path program 1 times [2025-03-08 06:51:25,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:25,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431927738] [2025-03-08 06:51:25,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:25,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:25,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:51:25,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:51:25,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:25,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:26,154 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:51:26,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:26,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431927738] [2025-03-08 06:51:26,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431927738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:26,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:26,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:51:26,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485466715] [2025-03-08 06:51:26,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:26,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:51:26,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:26,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:51:26,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:51:26,187 INFO L87 Difference]: Start difference. First operand has 2438 states, 2409 states have (on average 1.8451639684516397) internal successors, (4445), 2411 states have internal predecessors, (4445), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:51:26,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:26,724 INFO L93 Difference]: Finished difference Result 4875 states and 8979 transitions. [2025-03-08 06:51:26,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:51:26,726 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 06:51:26,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:26,749 INFO L225 Difference]: With dead ends: 4875 [2025-03-08 06:51:26,749 INFO L226 Difference]: Without dead ends: 2387 [2025-03-08 06:51:26,758 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:51:26,761 INFO L435 NwaCegarLoop]: 4314 mSDtfsCounter, 4541 mSDsluCounter, 8523 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4556 SdHoareTripleChecker+Valid, 12837 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:26,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4556 Valid, 12837 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:51:26,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2387 states. [2025-03-08 06:51:26,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2387 to 2371. [2025-03-08 06:51:26,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 2342 states have (on average 1.8373185311699403) internal successors, (4303), 2344 states have internal predecessors, (4303), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-03-08 06:51:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 4345 transitions. [2025-03-08 06:51:26,902 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 4345 transitions. Word has length 121 [2025-03-08 06:51:26,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:26,903 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 4345 transitions. [2025-03-08 06:51:26,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:51:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 4345 transitions. [2025-03-08 06:51:26,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:51:26,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:26,907 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:51:26,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:51:26,907 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:26,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:26,908 INFO L85 PathProgramCache]: Analyzing trace with hash -792968874, now seen corresponding path program 1 times [2025-03-08 06:51:26,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:26,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411208582] [2025-03-08 06:51:26,909 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:26,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:26,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:51:26,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:51:26,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:26,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:27,136 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:51:27,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:27,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411208582] [2025-03-08 06:51:27,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411208582] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:27,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:27,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:27,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315643221] [2025-03-08 06:51:27,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:27,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:27,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:27,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:27,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:27,138 INFO L87 Difference]: Start difference. First operand 2371 states and 4345 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:51:27,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:27,815 INFO L93 Difference]: Finished difference Result 2885 states and 5161 transitions. [2025-03-08 06:51:27,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:27,816 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 06:51:27,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:27,830 INFO L225 Difference]: With dead ends: 2885 [2025-03-08 06:51:27,830 INFO L226 Difference]: Without dead ends: 2650 [2025-03-08 06:51:27,832 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:51:27,833 INFO L435 NwaCegarLoop]: 4455 mSDtfsCounter, 4674 mSDsluCounter, 13459 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4689 SdHoareTripleChecker+Valid, 17914 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:27,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4689 Valid, 17914 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:51:27,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2650 states. [2025-03-08 06:51:27,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2650 to 2618. [2025-03-08 06:51:27,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2618 states, 2563 states have (on average 1.81467030823254) internal successors, (4651), 2567 states have internal predecessors, (4651), 39 states have call successors, (39), 12 states have call predecessors, (39), 14 states have return successors, (46), 40 states have call predecessors, (46), 39 states have call successors, (46) [2025-03-08 06:51:27,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2618 states to 2618 states and 4736 transitions. [2025-03-08 06:51:27,939 INFO L78 Accepts]: Start accepts. Automaton has 2618 states and 4736 transitions. Word has length 121 [2025-03-08 06:51:27,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:27,939 INFO L471 AbstractCegarLoop]: Abstraction has 2618 states and 4736 transitions. [2025-03-08 06:51:27,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:51:27,940 INFO L276 IsEmpty]: Start isEmpty. Operand 2618 states and 4736 transitions. [2025-03-08 06:51:27,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:51:27,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:27,943 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] [2025-03-08 06:51:27,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:51:27,943 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:27,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:27,947 INFO L85 PathProgramCache]: Analyzing trace with hash 700943575, now seen corresponding path program 1 times [2025-03-08 06:51:27,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:27,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042290748] [2025-03-08 06:51:27,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:27,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:27,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:51:27,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:51:27,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:27,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:28,129 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:51:28,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:28,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042290748] [2025-03-08 06:51:28,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042290748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:28,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:28,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:28,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721854451] [2025-03-08 06:51:28,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:28,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:28,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:28,132 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:28,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:28,132 INFO L87 Difference]: Start difference. First operand 2618 states and 4736 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:51:28,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:28,759 INFO L93 Difference]: Finished difference Result 3622 states and 6329 transitions. [2025-03-08 06:51:28,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:28,760 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 06:51:28,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:28,772 INFO L225 Difference]: With dead ends: 3622 [2025-03-08 06:51:28,772 INFO L226 Difference]: Without dead ends: 3142 [2025-03-08 06:51:28,775 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:51:28,776 INFO L435 NwaCegarLoop]: 4421 mSDtfsCounter, 4670 mSDsluCounter, 13388 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4685 SdHoareTripleChecker+Valid, 17809 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:28,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4685 Valid, 17809 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:51:28,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3142 states. [2025-03-08 06:51:28,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3142 to 3098. [2025-03-08 06:51:28,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3098 states, 2995 states have (on average 1.778964941569282) internal successors, (5328), 3003 states have internal predecessors, (5328), 71 states have call successors, (71), 24 states have call predecessors, (71), 30 states have return successors, (94), 74 states have call predecessors, (94), 71 states have call successors, (94) [2025-03-08 06:51:28,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 5493 transitions. [2025-03-08 06:51:28,873 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 5493 transitions. Word has length 121 [2025-03-08 06:51:28,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:28,874 INFO L471 AbstractCegarLoop]: Abstraction has 3098 states and 5493 transitions. [2025-03-08 06:51:28,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:51:28,874 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 5493 transitions. [2025-03-08 06:51:28,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:51:28,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:28,876 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] [2025-03-08 06:51:28,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:51:28,876 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:28,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:28,877 INFO L85 PathProgramCache]: Analyzing trace with hash -497791690, now seen corresponding path program 1 times [2025-03-08 06:51:28,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:28,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936956941] [2025-03-08 06:51:28,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:28,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:28,891 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:51:28,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:51:28,898 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:28,898 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:29,076 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:51:29,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:29,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936956941] [2025-03-08 06:51:29,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936956941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:29,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:29,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:29,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489756466] [2025-03-08 06:51:29,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:29,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:29,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:29,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:29,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:29,080 INFO L87 Difference]: Start difference. First operand 3098 states and 5493 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:51:29,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:29,715 INFO L93 Difference]: Finished difference Result 5159 states and 8800 transitions. [2025-03-08 06:51:29,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:29,715 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 06:51:29,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:29,733 INFO L225 Difference]: With dead ends: 5159 [2025-03-08 06:51:29,733 INFO L226 Difference]: Without dead ends: 4199 [2025-03-08 06:51:29,739 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:51:29,739 INFO L435 NwaCegarLoop]: 4419 mSDtfsCounter, 4665 mSDsluCounter, 13376 mSDsCounter, 0 mSdLazyCounter, 727 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4680 SdHoareTripleChecker+Valid, 17795 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:29,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4680 Valid, 17795 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 727 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 06:51:29,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4199 states. [2025-03-08 06:51:29,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4199 to 4132. [2025-03-08 06:51:29,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4132 states, 3927 states have (on average 1.73414820473644) internal successors, (6810), 3949 states have internal predecessors, (6810), 135 states have call successors, (135), 48 states have call predecessors, (135), 68 states have return successors, (214), 142 states have call predecessors, (214), 135 states have call successors, (214) [2025-03-08 06:51:29,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4132 states to 4132 states and 7159 transitions. [2025-03-08 06:51:29,888 INFO L78 Accepts]: Start accepts. Automaton has 4132 states and 7159 transitions. Word has length 121 [2025-03-08 06:51:29,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:29,889 INFO L471 AbstractCegarLoop]: Abstraction has 4132 states and 7159 transitions. [2025-03-08 06:51:29,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:51:29,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4132 states and 7159 transitions. [2025-03-08 06:51:29,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:51:29,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:29,892 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] [2025-03-08 06:51:29,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:51:29,893 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:29,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:29,893 INFO L85 PathProgramCache]: Analyzing trace with hash 17728759, now seen corresponding path program 1 times [2025-03-08 06:51:29,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:29,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780276980] [2025-03-08 06:51:29,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:29,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:29,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:51:29,909 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:51:29,909 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:29,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:30,032 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:51:30,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:30,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780276980] [2025-03-08 06:51:30,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780276980] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:30,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:30,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:30,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88839761] [2025-03-08 06:51:30,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:30,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:30,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:30,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:30,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:30,034 INFO L87 Difference]: Start difference. First operand 4132 states and 7159 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:51:30,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:30,693 INFO L93 Difference]: Finished difference Result 8510 states and 14338 transitions. [2025-03-08 06:51:30,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:30,694 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 06:51:30,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:30,727 INFO L225 Difference]: With dead ends: 8510 [2025-03-08 06:51:30,727 INFO L226 Difference]: Without dead ends: 6516 [2025-03-08 06:51:30,738 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:51:30,739 INFO L435 NwaCegarLoop]: 4415 mSDtfsCounter, 4660 mSDsluCounter, 13359 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4675 SdHoareTripleChecker+Valid, 17774 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:30,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4675 Valid, 17774 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:51:30,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6516 states. [2025-03-08 06:51:30,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6516 to 6406. [2025-03-08 06:51:31,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6406 states, 5979 states have (on average 1.6939287506271952) internal successors, (10128), 6047 states have internal predecessors, (10128), 263 states have call successors, (263), 96 states have call predecessors, (263), 162 states have return successors, (550), 278 states have call predecessors, (550), 263 states have call successors, (550) [2025-03-08 06:51:31,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6406 states to 6406 states and 10941 transitions. [2025-03-08 06:51:31,034 INFO L78 Accepts]: Start accepts. Automaton has 6406 states and 10941 transitions. Word has length 121 [2025-03-08 06:51:31,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:31,035 INFO L471 AbstractCegarLoop]: Abstraction has 6406 states and 10941 transitions. [2025-03-08 06:51:31,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:51:31,039 INFO L276 IsEmpty]: Start isEmpty. Operand 6406 states and 10941 transitions. [2025-03-08 06:51:31,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:51:31,043 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:31,044 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] [2025-03-08 06:51:31,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:51:31,044 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:31,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:31,044 INFO L85 PathProgramCache]: Analyzing trace with hash -935472874, now seen corresponding path program 1 times [2025-03-08 06:51:31,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:31,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685378706] [2025-03-08 06:51:31,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:31,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:31,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:51:31,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:51:31,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:31,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:31,181 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:51:31,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:31,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685378706] [2025-03-08 06:51:31,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685378706] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:31,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:31,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:31,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573384725] [2025-03-08 06:51:31,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:31,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:31,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:31,183 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:31,183 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:31,183 INFO L87 Difference]: Start difference. First operand 6406 states and 10941 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:51:31,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:31,940 INFO L93 Difference]: Finished difference Result 15977 states and 27196 transitions. [2025-03-08 06:51:31,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:31,941 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 06:51:31,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:32,014 INFO L225 Difference]: With dead ends: 15977 [2025-03-08 06:51:32,014 INFO L226 Difference]: Without dead ends: 11709 [2025-03-08 06:51:32,033 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:51:32,035 INFO L435 NwaCegarLoop]: 4413 mSDtfsCounter, 4655 mSDsluCounter, 13347 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4670 SdHoareTripleChecker+Valid, 17760 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:32,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4670 Valid, 17760 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:51:32,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11709 states. [2025-03-08 06:51:32,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11709 to 11520. [2025-03-08 06:51:32,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11520 states, 10595 states have (on average 1.673053327041057) internal successors, (17726), 10809 states have internal predecessors, (17726), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-03-08 06:51:32,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11520 states to 11520 states and 19851 transitions. [2025-03-08 06:51:32,426 INFO L78 Accepts]: Start accepts. Automaton has 11520 states and 19851 transitions. Word has length 121 [2025-03-08 06:51:32,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:32,427 INFO L471 AbstractCegarLoop]: Abstraction has 11520 states and 19851 transitions. [2025-03-08 06:51:32,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:51:32,428 INFO L276 IsEmpty]: Start isEmpty. Operand 11520 states and 19851 transitions. [2025-03-08 06:51:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:51:32,435 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:32,436 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] [2025-03-08 06:51:32,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:51:32,436 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:32,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:32,437 INFO L85 PathProgramCache]: Analyzing trace with hash -134937321, now seen corresponding path program 1 times [2025-03-08 06:51:32,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:32,437 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753113514] [2025-03-08 06:51:32,437 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:32,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:32,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:51:32,448 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:51:32,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:32,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:32,515 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:51:32,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:32,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753113514] [2025-03-08 06:51:32,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753113514] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:32,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:32,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:51:32,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143002621] [2025-03-08 06:51:32,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:32,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:51:32,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:32,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:51:32,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:51:32,516 INFO L87 Difference]: Start difference. First operand 11520 states and 19851 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:51:33,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:33,036 INFO L93 Difference]: Finished difference Result 23334 states and 41003 transitions. [2025-03-08 06:51:33,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:51:33,036 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 06:51:33,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:33,089 INFO L225 Difference]: With dead ends: 23334 [2025-03-08 06:51:33,089 INFO L226 Difference]: Without dead ends: 13950 [2025-03-08 06:51:33,117 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:51:33,118 INFO L435 NwaCegarLoop]: 4234 mSDtfsCounter, 4466 mSDsluCounter, 8364 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4481 SdHoareTripleChecker+Valid, 12598 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:33,118 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4481 Valid, 12598 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:51:33,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13950 states. [2025-03-08 06:51:33,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13950 to 11520. [2025-03-08 06:51:33,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11520 states, 10595 states have (on average 1.6699386503067484) internal successors, (17693), 10809 states have internal predecessors, (17693), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-03-08 06:51:33,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11520 states to 11520 states and 19818 transitions. [2025-03-08 06:51:33,545 INFO L78 Accepts]: Start accepts. Automaton has 11520 states and 19818 transitions. Word has length 121 [2025-03-08 06:51:33,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:33,545 INFO L471 AbstractCegarLoop]: Abstraction has 11520 states and 19818 transitions. [2025-03-08 06:51:33,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:51:33,545 INFO L276 IsEmpty]: Start isEmpty. Operand 11520 states and 19818 transitions. [2025-03-08 06:51:33,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:51:33,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:33,552 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] [2025-03-08 06:51:33,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:51:33,552 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:33,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:33,552 INFO L85 PathProgramCache]: Analyzing trace with hash -663302922, now seen corresponding path program 1 times [2025-03-08 06:51:33,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:33,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918916767] [2025-03-08 06:51:33,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:33,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:33,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:51:33,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:51:33,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:33,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:33,632 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:51:33,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:33,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918916767] [2025-03-08 06:51:33,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918916767] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:33,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:33,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:51:33,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369311694] [2025-03-08 06:51:33,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:33,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:51:33,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:33,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:51:33,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:51:33,633 INFO L87 Difference]: Start difference. First operand 11520 states and 19818 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:51:34,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:34,266 INFO L93 Difference]: Finished difference Result 22848 states and 39965 transitions. [2025-03-08 06:51:34,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:51:34,266 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 06:51:34,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:34,311 INFO L225 Difference]: With dead ends: 22848 [2025-03-08 06:51:34,311 INFO L226 Difference]: Without dead ends: 13464 [2025-03-08 06:51:34,334 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:51:34,335 INFO L435 NwaCegarLoop]: 4229 mSDtfsCounter, 4460 mSDsluCounter, 8353 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4475 SdHoareTripleChecker+Valid, 12582 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:34,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4475 Valid, 12582 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:51:34,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13464 states. [2025-03-08 06:51:34,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13464 to 11520. [2025-03-08 06:51:34,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11520 states, 10595 states have (on average 1.6668239735724397) internal successors, (17660), 10809 states have internal predecessors, (17660), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-03-08 06:51:34,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11520 states to 11520 states and 19785 transitions. [2025-03-08 06:51:34,718 INFO L78 Accepts]: Start accepts. Automaton has 11520 states and 19785 transitions. Word has length 121 [2025-03-08 06:51:34,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:34,720 INFO L471 AbstractCegarLoop]: Abstraction has 11520 states and 19785 transitions. [2025-03-08 06:51:34,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:51:34,720 INFO L276 IsEmpty]: Start isEmpty. Operand 11520 states and 19785 transitions. [2025-03-08 06:51:34,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:51:34,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:34,726 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] [2025-03-08 06:51:34,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:51:34,727 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:34,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:34,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1472790379, now seen corresponding path program 1 times [2025-03-08 06:51:34,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:34,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097129780] [2025-03-08 06:51:34,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:34,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:34,735 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:51:34,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:51:34,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:34,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:34,837 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:51:34,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:34,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097129780] [2025-03-08 06:51:34,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097129780] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:34,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:34,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:34,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554844222] [2025-03-08 06:51:34,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:34,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:34,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:34,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:34,839 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:34,839 INFO L87 Difference]: Start difference. First operand 11520 states and 19785 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:51:36,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:36,016 INFO L93 Difference]: Finished difference Result 33455 states and 58477 transitions. [2025-03-08 06:51:36,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:36,016 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 06:51:36,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:36,131 INFO L225 Difference]: With dead ends: 33455 [2025-03-08 06:51:36,131 INFO L226 Difference]: Without dead ends: 24073 [2025-03-08 06:51:36,168 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:51:36,172 INFO L435 NwaCegarLoop]: 4398 mSDtfsCounter, 4796 mSDsluCounter, 13279 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4819 SdHoareTripleChecker+Valid, 17677 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:36,172 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4819 Valid, 17677 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:51:36,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24073 states. [2025-03-08 06:51:37,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24073 to 22464. [2025-03-08 06:51:37,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22464 states, 20413 states have (on average 1.658256993092637) internal successors, (33850), 21081 states have internal predecessors, (33850), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-03-08 06:51:37,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22464 states to 22464 states and 40071 transitions. [2025-03-08 06:51:37,173 INFO L78 Accepts]: Start accepts. Automaton has 22464 states and 40071 transitions. Word has length 121 [2025-03-08 06:51:37,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:37,176 INFO L471 AbstractCegarLoop]: Abstraction has 22464 states and 40071 transitions. [2025-03-08 06:51:37,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:51:37,176 INFO L276 IsEmpty]: Start isEmpty. Operand 22464 states and 40071 transitions. [2025-03-08 06:51:37,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:51:37,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:37,186 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] [2025-03-08 06:51:37,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 06:51:37,186 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:37,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:37,186 INFO L85 PathProgramCache]: Analyzing trace with hash -1914544874, now seen corresponding path program 1 times [2025-03-08 06:51:37,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:37,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1567891283] [2025-03-08 06:51:37,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:37,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:37,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:51:37,197 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:51:37,199 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:37,199 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:37,272 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:51:37,272 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:37,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1567891283] [2025-03-08 06:51:37,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1567891283] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:37,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:37,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:51:37,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704356573] [2025-03-08 06:51:37,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:37,273 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:51:37,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:37,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:51:37,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:51:37,274 INFO L87 Difference]: Start difference. First operand 22464 states and 40071 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:51:38,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:38,219 INFO L93 Difference]: Finished difference Result 47166 states and 87073 transitions. [2025-03-08 06:51:38,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:51:38,220 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 06:51:38,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:38,325 INFO L225 Difference]: With dead ends: 47166 [2025-03-08 06:51:38,325 INFO L226 Difference]: Without dead ends: 26838 [2025-03-08 06:51:38,370 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:51:38,370 INFO L435 NwaCegarLoop]: 4224 mSDtfsCounter, 4456 mSDsluCounter, 8344 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4471 SdHoareTripleChecker+Valid, 12568 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:38,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4471 Valid, 12568 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:51:38,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26838 states. [2025-03-08 06:51:39,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26838 to 22464. [2025-03-08 06:51:39,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22464 states, 20413 states have (on average 1.6550727477587812) internal successors, (33785), 21081 states have internal predecessors, (33785), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-03-08 06:51:39,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22464 states to 22464 states and 40006 transitions. [2025-03-08 06:51:39,555 INFO L78 Accepts]: Start accepts. Automaton has 22464 states and 40006 transitions. Word has length 121 [2025-03-08 06:51:39,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:39,555 INFO L471 AbstractCegarLoop]: Abstraction has 22464 states and 40006 transitions. [2025-03-08 06:51:39,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:51:39,556 INFO L276 IsEmpty]: Start isEmpty. Operand 22464 states and 40006 transitions. [2025-03-08 06:51:39,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:51:39,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:39,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] [2025-03-08 06:51:39,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 06:51:39,565 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:39,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:39,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1928795019, now seen corresponding path program 1 times [2025-03-08 06:51:39,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:39,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353601967] [2025-03-08 06:51:39,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:39,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:39,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:51:39,578 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:51:39,579 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:39,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:39,640 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:51:39,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:39,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353601967] [2025-03-08 06:51:39,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353601967] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:39,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:39,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:51:39,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111067584] [2025-03-08 06:51:39,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:39,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:51:39,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:39,641 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:51:39,641 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:51:39,641 INFO L87 Difference]: Start difference. First operand 22464 states and 40006 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:51:40,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:40,889 INFO L93 Difference]: Finished difference Result 46437 states and 85485 transitions. [2025-03-08 06:51:40,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:51:40,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 06:51:40,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:41,032 INFO L225 Difference]: With dead ends: 46437 [2025-03-08 06:51:41,033 INFO L226 Difference]: Without dead ends: 26109 [2025-03-08 06:51:41,101 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:51:41,103 INFO L435 NwaCegarLoop]: 4221 mSDtfsCounter, 4453 mSDsluCounter, 8339 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4468 SdHoareTripleChecker+Valid, 12560 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:41,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4468 Valid, 12560 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:51:41,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26109 states. [2025-03-08 06:51:42,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26109 to 22464. [2025-03-08 06:51:42,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22464 states, 20413 states have (on average 1.6518885024249252) internal successors, (33720), 21081 states have internal predecessors, (33720), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-03-08 06:51:42,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22464 states to 22464 states and 39941 transitions. [2025-03-08 06:51:42,529 INFO L78 Accepts]: Start accepts. Automaton has 22464 states and 39941 transitions. Word has length 121 [2025-03-08 06:51:42,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:42,529 INFO L471 AbstractCegarLoop]: Abstraction has 22464 states and 39941 transitions. [2025-03-08 06:51:42,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:51:42,530 INFO L276 IsEmpty]: Start isEmpty. Operand 22464 states and 39941 transitions. [2025-03-08 06:51:42,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:51:42,539 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:42,539 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] [2025-03-08 06:51:42,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 06:51:42,540 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:42,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:42,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1395881270, now seen corresponding path program 1 times [2025-03-08 06:51:42,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:42,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265740474] [2025-03-08 06:51:42,541 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:42,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:42,550 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:51:42,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:51:42,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:42,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:42,644 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:51:42,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:42,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265740474] [2025-03-08 06:51:42,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265740474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:42,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:42,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:42,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627568326] [2025-03-08 06:51:42,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:42,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:42,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:42,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:42,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:42,647 INFO L87 Difference]: Start difference. First operand 22464 states and 39941 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:51:44,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:44,565 INFO L93 Difference]: Finished difference Result 67462 states and 126143 transitions. [2025-03-08 06:51:44,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:44,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 06:51:44,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:44,768 INFO L225 Difference]: With dead ends: 67462 [2025-03-08 06:51:44,768 INFO L226 Difference]: Without dead ends: 47136 [2025-03-08 06:51:44,843 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:51:44,844 INFO L435 NwaCegarLoop]: 4387 mSDtfsCounter, 4685 mSDsluCounter, 13230 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4708 SdHoareTripleChecker+Valid, 17617 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:44,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4708 Valid, 17617 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:51:44,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47136 states. [2025-03-08 06:51:47,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47136 to 45466. [2025-03-08 06:51:47,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45466 states, 40709 states have (on average 1.6418482399469405) internal successors, (66838), 42771 states have internal predecessors, (66838), 1927 states have call successors, (1927), 768 states have call predecessors, (1927), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-03-08 06:51:48,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45466 states to 45466 states and 87331 transitions. [2025-03-08 06:51:48,036 INFO L78 Accepts]: Start accepts. Automaton has 45466 states and 87331 transitions. Word has length 121 [2025-03-08 06:51:48,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:48,036 INFO L471 AbstractCegarLoop]: Abstraction has 45466 states and 87331 transitions. [2025-03-08 06:51:48,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:51:48,037 INFO L276 IsEmpty]: Start isEmpty. Operand 45466 states and 87331 transitions. [2025-03-08 06:51:48,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:51:48,052 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:48,052 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] [2025-03-08 06:51:48,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 06:51:48,052 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:48,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:48,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1960554411, now seen corresponding path program 1 times [2025-03-08 06:51:48,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:48,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165562126] [2025-03-08 06:51:48,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:48,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:48,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:51:48,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:51:48,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:48,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:51:48,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:48,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165562126] [2025-03-08 06:51:48,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165562126] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:48,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:48,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:51:48,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828027329] [2025-03-08 06:51:48,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:48,124 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:51:48,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:48,125 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:51:48,125 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:51:48,125 INFO L87 Difference]: Start difference. First operand 45466 states and 87331 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:51:50,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:50,261 INFO L93 Difference]: Finished difference Result 95357 states and 194137 transitions. [2025-03-08 06:51:50,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:51:50,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 06:51:50,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:51:50,482 INFO L225 Difference]: With dead ends: 95357 [2025-03-08 06:51:50,482 INFO L226 Difference]: Without dead ends: 52027 [2025-03-08 06:51:50,589 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:51:50,590 INFO L435 NwaCegarLoop]: 4216 mSDtfsCounter, 4449 mSDsluCounter, 8330 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4464 SdHoareTripleChecker+Valid, 12546 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 06:51:50,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4464 Valid, 12546 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 06:51:50,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52027 states. [2025-03-08 06:51:55,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52027 to 45466. [2025-03-08 06:51:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45466 states, 40709 states have (on average 1.6386794075020266) internal successors, (66709), 42771 states have internal predecessors, (66709), 1927 states have call successors, (1927), 768 states have call predecessors, (1927), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-03-08 06:51:55,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45466 states to 45466 states and 87202 transitions. [2025-03-08 06:51:55,515 INFO L78 Accepts]: Start accepts. Automaton has 45466 states and 87202 transitions. Word has length 121 [2025-03-08 06:51:55,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:51:55,515 INFO L471 AbstractCegarLoop]: Abstraction has 45466 states and 87202 transitions. [2025-03-08 06:51:55,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 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:51:55,515 INFO L276 IsEmpty]: Start isEmpty. Operand 45466 states and 87202 transitions. [2025-03-08 06:51:55,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:51:55,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:51:55,531 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] [2025-03-08 06:51:55,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 06:51:55,531 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:51:55,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:51:55,532 INFO L85 PathProgramCache]: Analyzing trace with hash 1949046102, now seen corresponding path program 1 times [2025-03-08 06:51:55,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:51:55,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489348102] [2025-03-08 06:51:55,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:51:55,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:51:55,537 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:51:55,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:51:55,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:51:55,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:51:55,602 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:51:55,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:51:55,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489348102] [2025-03-08 06:51:55,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489348102] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:51:55,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:51:55,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:51:55,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805073223] [2025-03-08 06:51:55,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:51:55,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:51:55,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:51:55,603 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:51:55,603 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:51:55,603 INFO L87 Difference]: Start difference. First operand 45466 states and 87202 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:51:59,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:51:59,756 INFO L93 Difference]: Finished difference Result 137344 states and 290425 transitions. [2025-03-08 06:51:59,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:51:59,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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 121 [2025-03-08 06:51:59,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:52:00,140 INFO L225 Difference]: With dead ends: 137344 [2025-03-08 06:52:00,140 INFO L226 Difference]: Without dead ends: 94016 [2025-03-08 06:52:00,264 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:52:00,265 INFO L435 NwaCegarLoop]: 4379 mSDtfsCounter, 4612 mSDsluCounter, 13198 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4635 SdHoareTripleChecker+Valid, 17577 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 06:52:00,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4635 Valid, 17577 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 06:52:00,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94016 states. [2025-03-08 06:52:08,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94016 to 92732. [2025-03-08 06:52:08,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92732 states, 81169 states have (on average 1.6158755189789205) internal successors, (131159), 87477 states have internal predecessors, (131159), 3719 states have call successors, (3719), 1536 states have call predecessors, (3719), 7842 states have return successors, (69766), 3974 states have call predecessors, (69766), 3719 states have call successors, (69766) [2025-03-08 06:52:09,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92732 states to 92732 states and 204644 transitions. [2025-03-08 06:52:09,182 INFO L78 Accepts]: Start accepts. Automaton has 92732 states and 204644 transitions. Word has length 121 [2025-03-08 06:52:09,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:52:09,182 INFO L471 AbstractCegarLoop]: Abstraction has 92732 states and 204644 transitions. [2025-03-08 06:52:09,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 5 states have internal predecessors, (111), 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:52:09,183 INFO L276 IsEmpty]: Start isEmpty. Operand 92732 states and 204644 transitions. [2025-03-08 06:52:09,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-08 06:52:09,221 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:52:09,221 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:52:09,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 06:52:09,221 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:52:09,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:52:09,221 INFO L85 PathProgramCache]: Analyzing trace with hash -695784395, now seen corresponding path program 1 times [2025-03-08 06:52:09,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:52:09,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103432718] [2025-03-08 06:52:09,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:52:09,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:52:09,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-08 06:52:09,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-08 06:52:09,234 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:52:09,234 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:52:09,286 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:52:09,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:52:09,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103432718] [2025-03-08 06:52:09,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103432718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:52:09,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:52:09,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:52:09,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789569646] [2025-03-08 06:52:09,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:52:09,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:52:09,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:52:09,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:52:09,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:52:09,288 INFO L87 Difference]: Start difference. First operand 92732 states and 204644 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5)