./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash db9df7d135a21d792e3a2ca832f85f7c7fc22de6655b2cb0ba03be5cd467b7e3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 19:59:04,473 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 19:59:04,527 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 19:59:04,530 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 19:59:04,531 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 19:59:04,543 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 19:59:04,544 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 19:59:04,544 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 19:59:04,544 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 19:59:04,544 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 19:59:04,544 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 19:59:04,544 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 19:59:04,544 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 19:59:04,544 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 19:59:04,544 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 19:59:04,544 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 19:59:04,544 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 19:59:04,545 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 19:59:04,545 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 19:59:04,545 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 19:59:04,545 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 19:59:04,545 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 19:59:04,545 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 19:59:04,545 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 19:59:04,545 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 19:59:04,545 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 19:59:04,545 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 19:59:04,545 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 19:59:04,545 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 19:59:04,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 19:59:04,545 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 19:59:04,545 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 19:59:04,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:59:04,545 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 19:59:04,545 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 19:59:04,545 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 19:59:04,546 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 19:59:04,546 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 19:59:04,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 19:59:04,546 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 19:59:04,546 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 19:59:04,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 19:59:04,546 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 19:59:04,546 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 -> db9df7d135a21d792e3a2ca832f85f7c7fc22de6655b2cb0ba03be5cd467b7e3 [2025-03-16 19:59:04,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 19:59:04,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 19:59:04,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 19:59:04,763 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 19:59:04,764 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 19:59:04,764 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-1.c [2025-03-16 19:59:05,852 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d65efa2/514976977158425c9a4ec34a303921e7/FLAGeeb0bd511 [2025-03-16 19:59:06,309 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 19:59:06,310 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label43+token_ring.08.cil-1.c [2025-03-16 19:59:06,355 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d65efa2/514976977158425c9a4ec34a303921e7/FLAGeeb0bd511 [2025-03-16 19:59:06,424 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a5d65efa2/514976977158425c9a4ec34a303921e7 [2025-03-16 19:59:06,426 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 19:59:06,427 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 19:59:06,428 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 19:59:06,428 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 19:59:06,431 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 19:59:06,431 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:59:06" (1/1) ... [2025-03-16 19:59:06,433 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18641aee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:06, skipping insertion in model container [2025-03-16 19:59:06,433 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 07:59:06" (1/1) ... [2025-03-16 19:59:06,552 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 19:59:07,586 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.08.cil-1.c[381679,381692] [2025-03-16 19:59:07,611 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.08.cil-1.c[383339,383352] [2025-03-16 19:59:07,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:59:07,849 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 19:59:08,311 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.08.cil-1.c[381679,381692] [2025-03-16 19:59:08,314 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.08.cil-1.c[383339,383352] [2025-03-16 19:59:08,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 19:59:08,369 INFO L204 MainTranslator]: Completed translation [2025-03-16 19:59:08,370 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:08 WrapperNode [2025-03-16 19:59:08,371 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 19:59:08,372 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 19:59:08,372 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 19:59:08,372 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 19:59:08,376 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:08" (1/1) ... [2025-03-16 19:59:08,451 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:08" (1/1) ... [2025-03-16 19:59:08,825 INFO L138 Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12957 [2025-03-16 19:59:08,826 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 19:59:08,827 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 19:59:08,827 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 19:59:08,827 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 19:59:08,839 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:08" (1/1) ... [2025-03-16 19:59:08,839 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:08" (1/1) ... [2025-03-16 19:59:08,878 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:08" (1/1) ... [2025-03-16 19:59:08,978 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 19:59:08,978 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:08" (1/1) ... [2025-03-16 19:59:08,978 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:08" (1/1) ... [2025-03-16 19:59:09,099 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:08" (1/1) ... [2025-03-16 19:59:09,121 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:08" (1/1) ... [2025-03-16 19:59:09,142 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:08" (1/1) ... [2025-03-16 19:59:09,159 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:08" (1/1) ... [2025-03-16 19:59:09,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 19:59:09,205 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 19:59:09,206 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 19:59:09,206 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 19:59:09,207 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:08" (1/1) ... [2025-03-16 19:59:09,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 19:59:09,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 19:59:09,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 19:59:09,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 19:59:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 19:59:09,256 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-16 19:59:09,256 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-16 19:59:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-16 19:59:09,257 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-16 19:59:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-16 19:59:09,257 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-16 19:59:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-16 19:59:09,257 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-16 19:59:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-16 19:59:09,257 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-16 19:59:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-16 19:59:09,257 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-16 19:59:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 19:59:09,257 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 19:59:09,257 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 19:59:09,362 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 19:59:09,364 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 19:59:15,206 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-16 19:59:15,207 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-16 19:59:15,207 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-16 19:59:15,207 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-16 19:59:15,208 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-16 19:59:15,208 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-16 19:59:15,208 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-16 19:59:15,392 INFO L? ?]: Removed 1720 outVars from TransFormulas that were not future-live. [2025-03-16 19:59:15,392 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 19:59:15,453 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 19:59:15,454 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 19:59:15,454 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:59:15 BoogieIcfgContainer [2025-03-16 19:59:15,454 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 19:59:15,456 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 19:59:15,456 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 19:59:15,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 19:59:15,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 07:59:06" (1/3) ... [2025-03-16 19:59:15,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa1c145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:59:15, skipping insertion in model container [2025-03-16 19:59:15,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 07:59:08" (2/3) ... [2025-03-16 19:59:15,460 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fa1c145 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 07:59:15, skipping insertion in model container [2025-03-16 19:59:15,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 07:59:15" (3/3) ... [2025-03-16 19:59:15,461 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label43+token_ring.08.cil-1.c [2025-03-16 19:59:15,471 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 19:59:15,473 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label43+token_ring.08.cil-1.c that has 7 procedures, 2388 locations, 1 initial locations, 12 loop locations, and 2 error locations. [2025-03-16 19:59:15,570 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 19:59:15,580 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;@176039c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 19:59:15,580 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 19:59:15,589 INFO L276 IsEmpty]: Start isEmpty. Operand has 2388 states, 2358 states have (on average 1.8702290076335877) internal successors, (4410), 2360 states have internal predecessors, (4410), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 19:59:15,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:59:15,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:15,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-16 19:59:15,598 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:15,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:15,602 INFO L85 PathProgramCache]: Analyzing trace with hash -1165894761, now seen corresponding path program 1 times [2025-03-16 19:59:15,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:15,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985958305] [2025-03-16 19:59:15,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:15,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:15,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:59:15,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:59:15,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:15,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:15,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:15,859 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:15,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985958305] [2025-03-16 19:59:15,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985958305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:15,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:15,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 19:59:15,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863134645] [2025-03-16 19:59:15,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:15,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 19:59:15,866 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:15,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 19:59:15,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:59:15,887 INFO L87 Difference]: Start difference. First operand has 2388 states, 2358 states have (on average 1.8702290076335877) internal successors, (4410), 2360 states have internal predecessors, (4410), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:16,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:16,061 INFO L93 Difference]: Finished difference Result 4770 states and 8894 transitions. [2025-03-16 19:59:16,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 19:59:16,066 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 121 [2025-03-16 19:59:16,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:16,089 INFO L225 Difference]: With dead ends: 4770 [2025-03-16 19:59:16,089 INFO L226 Difference]: Without dead ends: 2383 [2025-03-16 19:59:16,098 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 19:59:16,102 INFO L435 NwaCegarLoop]: 4380 mSDtfsCounter, 412 mSDsluCounter, 3961 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 8341 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:16,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 8341 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 19:59:16,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2383 states. [2025-03-16 19:59:16,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2383 to 2383. [2025-03-16 19:59:16,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2383 states, 2353 states have (on average 1.839779005524862) internal successors, (4329), 2355 states have internal predecessors, (4329), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-03-16 19:59:16,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2383 states to 2383 states and 4373 transitions. [2025-03-16 19:59:16,231 INFO L78 Accepts]: Start accepts. Automaton has 2383 states and 4373 transitions. Word has length 121 [2025-03-16 19:59:16,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:16,232 INFO L471 AbstractCegarLoop]: Abstraction has 2383 states and 4373 transitions. [2025-03-16 19:59:16,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-16 19:59:16,232 INFO L276 IsEmpty]: Start isEmpty. Operand 2383 states and 4373 transitions. [2025-03-16 19:59:16,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:59:16,238 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:16,239 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 19:59:16,239 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 19:59:16,239 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:16,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:16,240 INFO L85 PathProgramCache]: Analyzing trace with hash -342213290, now seen corresponding path program 1 times [2025-03-16 19:59:16,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:16,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29190266] [2025-03-16 19:59:16,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:16,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:16,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:59:16,269 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:59:16,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:16,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:16,461 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:16,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:16,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29190266] [2025-03-16 19:59:16,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29190266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:16,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:16,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:59:16,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1823101580] [2025-03-16 19:59:16,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:16,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:59:16,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:16,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:59:16,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:16,465 INFO L87 Difference]: Start difference. First operand 2383 states and 4373 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 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-16 19:59:16,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:16,931 INFO L93 Difference]: Finished difference Result 2912 states and 5222 transitions. [2025-03-16 19:59:16,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 19:59:16,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 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-16 19:59:16,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:16,944 INFO L225 Difference]: With dead ends: 2912 [2025-03-16 19:59:16,944 INFO L226 Difference]: Without dead ends: 2664 [2025-03-16 19:59:16,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:16,947 INFO L435 NwaCegarLoop]: 4284 mSDtfsCounter, 4738 mSDsluCounter, 8740 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4754 SdHoareTripleChecker+Valid, 13024 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:16,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4754 Valid, 13024 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:59:16,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2025-03-16 19:59:17,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2643. [2025-03-16 19:59:17,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2643 states, 2589 states have (on average 1.8188489764387794) internal successors, (4709), 2592 states have internal predecessors, (4709), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-16 19:59:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 4788 transitions. [2025-03-16 19:59:17,014 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 4788 transitions. Word has length 121 [2025-03-16 19:59:17,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:17,015 INFO L471 AbstractCegarLoop]: Abstraction has 2643 states and 4788 transitions. [2025-03-16 19:59:17,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 4 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-16 19:59:17,015 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 4788 transitions. [2025-03-16 19:59:17,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:59:17,019 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:17,019 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-16 19:59:17,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 19:59:17,019 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:17,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:17,022 INFO L85 PathProgramCache]: Analyzing trace with hash 2077914614, now seen corresponding path program 1 times [2025-03-16 19:59:17,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:17,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023230087] [2025-03-16 19:59:17,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:17,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:17,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:59:17,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:59:17,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:17,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:17,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:17,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:17,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023230087] [2025-03-16 19:59:17,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023230087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:17,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:17,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:59:17,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899445027] [2025-03-16 19:59:17,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:17,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:59:17,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:17,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:59:17,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:17,342 INFO L87 Difference]: Start difference. First operand 2643 states and 4788 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-16 19:59:17,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:17,680 INFO L93 Difference]: Finished difference Result 3205 states and 5700 transitions. [2025-03-16 19:59:17,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:59:17,681 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-16 19:59:17,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:17,690 INFO L225 Difference]: With dead ends: 3205 [2025-03-16 19:59:17,690 INFO L226 Difference]: Without dead ends: 2697 [2025-03-16 19:59:17,692 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:17,693 INFO L435 NwaCegarLoop]: 4274 mSDtfsCounter, 4512 mSDsluCounter, 8433 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4528 SdHoareTripleChecker+Valid, 12707 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:17,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4528 Valid, 12707 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:59:17,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2025-03-16 19:59:17,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 2643. [2025-03-16 19:59:17,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2643 states, 2589 states have (on average 1.8180764774044031) internal successors, (4707), 2592 states have internal predecessors, (4707), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-03-16 19:59:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2643 states to 2643 states and 4786 transitions. [2025-03-16 19:59:17,743 INFO L78 Accepts]: Start accepts. Automaton has 2643 states and 4786 transitions. Word has length 121 [2025-03-16 19:59:17,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:17,743 INFO L471 AbstractCegarLoop]: Abstraction has 2643 states and 4786 transitions. [2025-03-16 19:59:17,743 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-16 19:59:17,743 INFO L276 IsEmpty]: Start isEmpty. Operand 2643 states and 4786 transitions. [2025-03-16 19:59:17,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:59:17,744 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:17,744 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-16 19:59:17,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 19:59:17,744 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:17,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:17,745 INFO L85 PathProgramCache]: Analyzing trace with hash -1086266057, now seen corresponding path program 1 times [2025-03-16 19:59:17,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:17,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106145431] [2025-03-16 19:59:17,745 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:17,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:17,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:59:17,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:59:17,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:17,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:17,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:17,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:17,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106145431] [2025-03-16 19:59:17,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106145431] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:17,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:17,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:17,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737106989] [2025-03-16 19:59:17,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:17,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:17,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:17,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:17,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:17,917 INFO L87 Difference]: Start difference. First operand 2643 states and 4786 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-16 19:59:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:18,476 INFO L93 Difference]: Finished difference Result 3480 states and 6133 transitions. [2025-03-16 19:59:18,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:59:18,477 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-16 19:59:18,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:18,490 INFO L225 Difference]: With dead ends: 3480 [2025-03-16 19:59:18,491 INFO L226 Difference]: Without dead ends: 2972 [2025-03-16 19:59:18,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:59:18,495 INFO L435 NwaCegarLoop]: 4502 mSDtfsCounter, 4732 mSDsluCounter, 13523 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4748 SdHoareTripleChecker+Valid, 18025 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:18,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4748 Valid, 18025 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:59:18,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2972 states. [2025-03-16 19:59:18,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2972 to 2883. [2025-03-16 19:59:18,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2883 states, 2805 states have (on average 1.7989304812834224) internal successors, (5046), 2809 states have internal predecessors, (5046), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (60), 57 states have call predecessors, (60), 56 states have call successors, (60) [2025-03-16 19:59:18,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2883 states to 2883 states and 5162 transitions. [2025-03-16 19:59:18,571 INFO L78 Accepts]: Start accepts. Automaton has 2883 states and 5162 transitions. Word has length 121 [2025-03-16 19:59:18,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:18,571 INFO L471 AbstractCegarLoop]: Abstraction has 2883 states and 5162 transitions. [2025-03-16 19:59:18,572 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-16 19:59:18,572 INFO L276 IsEmpty]: Start isEmpty. Operand 2883 states and 5162 transitions. [2025-03-16 19:59:18,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:59:18,574 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:18,574 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-16 19:59:18,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 19:59:18,574 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:18,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:18,575 INFO L85 PathProgramCache]: Analyzing trace with hash -2019620394, now seen corresponding path program 1 times [2025-03-16 19:59:18,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:18,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644796410] [2025-03-16 19:59:18,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:18,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:18,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:59:18,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:59:18,593 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:18,593 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:18,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:18,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:18,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644796410] [2025-03-16 19:59:18,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644796410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:18,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:18,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:18,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241109080] [2025-03-16 19:59:18,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:18,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:18,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:18,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:18,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:18,750 INFO L87 Difference]: Start difference. First operand 2883 states and 5162 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-16 19:59:19,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:19,253 INFO L93 Difference]: Finished difference Result 4243 states and 7346 transitions. [2025-03-16 19:59:19,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:59:19,254 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-16 19:59:19,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:19,271 INFO L225 Difference]: With dead ends: 4243 [2025-03-16 19:59:19,271 INFO L226 Difference]: Without dead ends: 3495 [2025-03-16 19:59:19,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:59:19,275 INFO L435 NwaCegarLoop]: 4307 mSDtfsCounter, 4751 mSDsluCounter, 13061 mSDsCounter, 0 mSdLazyCounter, 633 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4767 SdHoareTripleChecker+Valid, 17368 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:19,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4767 Valid, 17368 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:59:19,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3495 states. [2025-03-16 19:59:19,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3495 to 3394. [2025-03-16 19:59:19,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3394 states, 3266 states have (on average 1.769442743417024) internal successors, (5779), 3274 states have internal predecessors, (5779), 90 states have call successors, (90), 30 states have call predecessors, (90), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-03-16 19:59:19,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 5975 transitions. [2025-03-16 19:59:19,380 INFO L78 Accepts]: Start accepts. Automaton has 3394 states and 5975 transitions. Word has length 121 [2025-03-16 19:59:19,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:19,381 INFO L471 AbstractCegarLoop]: Abstraction has 3394 states and 5975 transitions. [2025-03-16 19:59:19,381 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-16 19:59:19,381 INFO L276 IsEmpty]: Start isEmpty. Operand 3394 states and 5975 transitions. [2025-03-16 19:59:19,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:59:19,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:19,383 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-16 19:59:19,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 19:59:19,383 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:19,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:19,388 INFO L85 PathProgramCache]: Analyzing trace with hash -525707945, now seen corresponding path program 1 times [2025-03-16 19:59:19,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:19,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254799523] [2025-03-16 19:59:19,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:19,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:19,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:59:19,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:59:19,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:19,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:19,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:19,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:19,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254799523] [2025-03-16 19:59:19,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254799523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:19,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:19,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:19,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703229514] [2025-03-16 19:59:19,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:19,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:19,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:19,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:19,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:19,512 INFO L87 Difference]: Start difference. First operand 3394 states and 5975 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-16 19:59:20,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:20,105 INFO L93 Difference]: Finished difference Result 5888 states and 10013 transitions. [2025-03-16 19:59:20,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:59:20,105 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-16 19:59:20,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:20,122 INFO L225 Difference]: With dead ends: 5888 [2025-03-16 19:59:20,122 INFO L226 Difference]: Without dead ends: 4629 [2025-03-16 19:59:20,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:59:20,127 INFO L435 NwaCegarLoop]: 4495 mSDtfsCounter, 4722 mSDsluCounter, 13502 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4738 SdHoareTripleChecker+Valid, 17997 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:20,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4738 Valid, 17997 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:59:20,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4629 states. [2025-03-16 19:59:20,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4629 to 4503. [2025-03-16 19:59:20,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4503 states, 4269 states have (on average 1.7331927851955962) internal successors, (7399), 4291 states have internal predecessors, (7399), 158 states have call successors, (158), 54 states have call predecessors, (158), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-03-16 19:59:20,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4503 states to 4503 states and 7779 transitions. [2025-03-16 19:59:20,286 INFO L78 Accepts]: Start accepts. Automaton has 4503 states and 7779 transitions. Word has length 121 [2025-03-16 19:59:20,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:20,286 INFO L471 AbstractCegarLoop]: Abstraction has 4503 states and 7779 transitions. [2025-03-16 19:59:20,286 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-16 19:59:20,287 INFO L276 IsEmpty]: Start isEmpty. Operand 4503 states and 7779 transitions. [2025-03-16 19:59:20,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:59:20,289 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:20,289 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-16 19:59:20,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 19:59:20,290 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:20,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:20,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1724443210, now seen corresponding path program 1 times [2025-03-16 19:59:20,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:20,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266653100] [2025-03-16 19:59:20,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:20,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:20,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:59:20,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:59:20,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:20,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:20,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:20,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:20,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266653100] [2025-03-16 19:59:20,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266653100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:20,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:20,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:20,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059901173] [2025-03-16 19:59:20,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:20,417 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:20,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:20,417 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:20,417 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:20,418 INFO L87 Difference]: Start difference. First operand 4503 states and 7779 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-16 19:59:21,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:21,077 INFO L93 Difference]: Finished difference Result 9507 states and 16047 transitions. [2025-03-16 19:59:21,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:59:21,078 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-16 19:59:21,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:21,120 INFO L225 Difference]: With dead ends: 9507 [2025-03-16 19:59:21,120 INFO L226 Difference]: Without dead ends: 7139 [2025-03-16 19:59:21,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:59:21,131 INFO L435 NwaCegarLoop]: 4492 mSDtfsCounter, 4717 mSDsluCounter, 13493 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4733 SdHoareTripleChecker+Valid, 17985 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:21,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4733 Valid, 17985 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:59:21,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7139 states. [2025-03-16 19:59:21,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7139 to 6964. [2025-03-16 19:59:21,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6964 states, 6500 states have (on average 1.7026153846153846) internal successors, (11067), 6568 states have internal predecessors, (11067), 294 states have call successors, (294), 102 states have call predecessors, (294), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-03-16 19:59:21,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6964 states to 6964 states and 11911 transitions. [2025-03-16 19:59:21,420 INFO L78 Accepts]: Start accepts. Automaton has 6964 states and 11911 transitions. Word has length 121 [2025-03-16 19:59:21,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:21,422 INFO L471 AbstractCegarLoop]: Abstraction has 6964 states and 11911 transitions. [2025-03-16 19:59:21,422 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-16 19:59:21,422 INFO L276 IsEmpty]: Start isEmpty. Operand 6964 states and 11911 transitions. [2025-03-16 19:59:21,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:59:21,425 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:21,425 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-16 19:59:21,425 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 19:59:21,426 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:21,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:21,426 INFO L85 PathProgramCache]: Analyzing trace with hash -1208922761, now seen corresponding path program 1 times [2025-03-16 19:59:21,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:21,426 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527153439] [2025-03-16 19:59:21,426 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:21,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:21,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:59:21,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:59:21,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:21,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:21,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:21,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:21,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527153439] [2025-03-16 19:59:21,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527153439] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:21,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:21,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:21,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213477274] [2025-03-16 19:59:21,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:21,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:21,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:21,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:21,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:21,528 INFO L87 Difference]: Start difference. First operand 6964 states and 11911 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-16 19:59:22,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:22,156 INFO L93 Difference]: Finished difference Result 17658 states and 30193 transitions. [2025-03-16 19:59:22,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:59:22,156 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-16 19:59:22,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:22,205 INFO L225 Difference]: With dead ends: 17658 [2025-03-16 19:59:22,206 INFO L226 Difference]: Without dead ends: 12829 [2025-03-16 19:59:22,227 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:59:22,228 INFO L435 NwaCegarLoop]: 4489 mSDtfsCounter, 4712 mSDsluCounter, 13484 mSDsCounter, 0 mSdLazyCounter, 782 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4728 SdHoareTripleChecker+Valid, 17973 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:22,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4728 Valid, 17973 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 782 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:59:22,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12829 states. [2025-03-16 19:59:22,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12829 to 12561. [2025-03-16 19:59:22,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12561 states, 11583 states have (on average 1.690667357334024) internal successors, (19583), 11797 states have internal predecessors, (19583), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-16 19:59:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12561 states to 12561 states and 21739 transitions. [2025-03-16 19:59:22,634 INFO L78 Accepts]: Start accepts. Automaton has 12561 states and 21739 transitions. Word has length 121 [2025-03-16 19:59:22,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:22,634 INFO L471 AbstractCegarLoop]: Abstraction has 12561 states and 21739 transitions. [2025-03-16 19:59:22,635 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-16 19:59:22,635 INFO L276 IsEmpty]: Start isEmpty. Operand 12561 states and 21739 transitions. [2025-03-16 19:59:22,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:59:22,640 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:22,641 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-16 19:59:22,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 19:59:22,641 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:22,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:22,641 INFO L85 PathProgramCache]: Analyzing trace with hash 2132842902, now seen corresponding path program 1 times [2025-03-16 19:59:22,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:22,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270793230] [2025-03-16 19:59:22,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:22,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:22,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:59:22,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:59:22,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:22,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:22,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:22,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:22,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270793230] [2025-03-16 19:59:22,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270793230] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:22,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:22,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:59:22,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262054423] [2025-03-16 19:59:22,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:22,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:59:22,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:22,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:59:22,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:22,725 INFO L87 Difference]: Start difference. First operand 12561 states and 21739 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-16 19:59:23,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:23,200 INFO L93 Difference]: Finished difference Result 25927 states and 45733 transitions. [2025-03-16 19:59:23,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:59:23,201 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-16 19:59:23,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:23,251 INFO L225 Difference]: With dead ends: 25927 [2025-03-16 19:59:23,252 INFO L226 Difference]: Without dead ends: 15501 [2025-03-16 19:59:23,281 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:23,281 INFO L435 NwaCegarLoop]: 4261 mSDtfsCounter, 4504 mSDsluCounter, 8408 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4520 SdHoareTripleChecker+Valid, 12669 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:23,282 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4520 Valid, 12669 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:59:23,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15501 states. [2025-03-16 19:59:23,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15501 to 12561. [2025-03-16 19:59:23,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12561 states, 11583 states have (on average 1.6878183544850212) internal successors, (19550), 11797 states have internal predecessors, (19550), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-16 19:59:23,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12561 states to 12561 states and 21706 transitions. [2025-03-16 19:59:23,774 INFO L78 Accepts]: Start accepts. Automaton has 12561 states and 21706 transitions. Word has length 121 [2025-03-16 19:59:23,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:23,775 INFO L471 AbstractCegarLoop]: Abstraction has 12561 states and 21706 transitions. [2025-03-16 19:59:23,775 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-16 19:59:23,775 INFO L276 IsEmpty]: Start isEmpty. Operand 12561 states and 21706 transitions. [2025-03-16 19:59:23,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:59:23,781 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:23,781 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-16 19:59:23,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 19:59:23,782 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:23,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:23,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1361588841, now seen corresponding path program 1 times [2025-03-16 19:59:23,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:23,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530790808] [2025-03-16 19:59:23,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:23,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:23,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:59:23,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:59:23,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:23,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:23,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:23,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:23,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530790808] [2025-03-16 19:59:23,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530790808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:23,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:23,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:59:23,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727550879] [2025-03-16 19:59:23,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:23,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:59:23,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:23,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:59:23,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:23,876 INFO L87 Difference]: Start difference. First operand 12561 states and 21706 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-16 19:59:24,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:24,546 INFO L93 Difference]: Finished difference Result 25682 states and 45177 transitions. [2025-03-16 19:59:24,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:59:24,549 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-16 19:59:24,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:24,598 INFO L225 Difference]: With dead ends: 25682 [2025-03-16 19:59:24,598 INFO L226 Difference]: Without dead ends: 15256 [2025-03-16 19:59:24,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:24,629 INFO L435 NwaCegarLoop]: 4258 mSDtfsCounter, 4501 mSDsluCounter, 8403 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4517 SdHoareTripleChecker+Valid, 12661 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:24,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4517 Valid, 12661 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 19:59:24,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15256 states. [2025-03-16 19:59:25,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15256 to 12561. [2025-03-16 19:59:25,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12561 states, 11583 states have (on average 1.6849693516360182) internal successors, (19517), 11797 states have internal predecessors, (19517), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-03-16 19:59:25,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12561 states to 12561 states and 21673 transitions. [2025-03-16 19:59:25,163 INFO L78 Accepts]: Start accepts. Automaton has 12561 states and 21673 transitions. Word has length 121 [2025-03-16 19:59:25,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:25,163 INFO L471 AbstractCegarLoop]: Abstraction has 12561 states and 21673 transitions. [2025-03-16 19:59:25,163 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-16 19:59:25,164 INFO L276 IsEmpty]: Start isEmpty. Operand 12561 states and 21673 transitions. [2025-03-16 19:59:25,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:59:25,168 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:25,169 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-16 19:59:25,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 19:59:25,169 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:25,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:25,169 INFO L85 PathProgramCache]: Analyzing trace with hash -1889954442, now seen corresponding path program 1 times [2025-03-16 19:59:25,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:25,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473258339] [2025-03-16 19:59:25,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:25,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:25,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:59:25,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:59:25,181 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:25,181 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:25,266 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:25,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:25,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473258339] [2025-03-16 19:59:25,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473258339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:25,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:25,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:25,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777612073] [2025-03-16 19:59:25,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:25,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:25,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:25,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:25,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:25,269 INFO L87 Difference]: Start difference. First operand 12561 states and 21673 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-16 19:59:26,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:26,224 INFO L93 Difference]: Finished difference Result 37593 states and 66162 transitions. [2025-03-16 19:59:26,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:59:26,228 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-16 19:59:26,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:26,314 INFO L225 Difference]: With dead ends: 37593 [2025-03-16 19:59:26,314 INFO L226 Difference]: Without dead ends: 27167 [2025-03-16 19:59:26,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:59:26,346 INFO L435 NwaCegarLoop]: 4474 mSDtfsCounter, 4918 mSDsluCounter, 13436 mSDsCounter, 0 mSdLazyCounter, 785 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4943 SdHoareTripleChecker+Valid, 17910 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:26,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4943 Valid, 17910 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 785 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:59:26,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27167 states. [2025-03-16 19:59:27,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27167 to 25036. [2025-03-16 19:59:27,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25036 states, 22900 states have (on average 1.6887772925764193) internal successors, (38673), 23568 states have internal predecessors, (38673), 1078 states have call successors, (1078), 390 states have call predecessors, (1078), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-03-16 19:59:27,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25036 states to 25036 states and 44925 transitions. [2025-03-16 19:59:27,111 INFO L78 Accepts]: Start accepts. Automaton has 25036 states and 44925 transitions. Word has length 121 [2025-03-16 19:59:27,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:27,112 INFO L471 AbstractCegarLoop]: Abstraction has 25036 states and 44925 transitions. [2025-03-16 19:59:27,112 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-16 19:59:27,112 INFO L276 IsEmpty]: Start isEmpty. Operand 25036 states and 44925 transitions. [2025-03-16 19:59:27,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:59:27,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:27,121 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-16 19:59:27,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 19:59:27,121 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:27,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:27,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1214261833, now seen corresponding path program 1 times [2025-03-16 19:59:27,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:27,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5314450] [2025-03-16 19:59:27,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:27,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:27,131 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:59:27,134 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:59:27,134 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:27,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:27,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:27,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:27,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5314450] [2025-03-16 19:59:27,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5314450] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:27,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:27,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:59:27,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119991337] [2025-03-16 19:59:27,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:27,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:59:27,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:27,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:59:27,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:27,205 INFO L87 Difference]: Start difference. First operand 25036 states and 44925 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-16 19:59:28,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:28,648 INFO L93 Difference]: Finished difference Result 54516 states and 101061 transitions. [2025-03-16 19:59:28,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:59:28,649 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-16 19:59:28,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:28,785 INFO L225 Difference]: With dead ends: 54516 [2025-03-16 19:59:28,786 INFO L226 Difference]: Without dead ends: 31615 [2025-03-16 19:59:28,860 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:28,860 INFO L435 NwaCegarLoop]: 4253 mSDtfsCounter, 4495 mSDsluCounter, 8392 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4511 SdHoareTripleChecker+Valid, 12645 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:28,861 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4511 Valid, 12645 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-16 19:59:28,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31615 states. [2025-03-16 19:59:30,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31615 to 25036. [2025-03-16 19:59:30,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25036 states, 22900 states have (on average 1.685938864628821) internal successors, (38608), 23568 states have internal predecessors, (38608), 1078 states have call successors, (1078), 390 states have call predecessors, (1078), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-03-16 19:59:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25036 states to 25036 states and 44860 transitions. [2025-03-16 19:59:30,124 INFO L78 Accepts]: Start accepts. Automaton has 25036 states and 44860 transitions. Word has length 121 [2025-03-16 19:59:30,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:30,125 INFO L471 AbstractCegarLoop]: Abstraction has 25036 states and 44860 transitions. [2025-03-16 19:59:30,125 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-16 19:59:30,125 INFO L276 IsEmpty]: Start isEmpty. Operand 25036 states and 44860 transitions. [2025-03-16 19:59:30,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:59:30,133 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:30,133 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-16 19:59:30,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 19:59:30,134 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:30,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:30,134 INFO L85 PathProgramCache]: Analyzing trace with hash -2023749290, now seen corresponding path program 1 times [2025-03-16 19:59:30,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:30,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185499127] [2025-03-16 19:59:30,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:30,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:30,141 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:59:30,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:59:30,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:30,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:30,222 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:30,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:30,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185499127] [2025-03-16 19:59:30,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185499127] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:30,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:30,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 19:59:30,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768671243] [2025-03-16 19:59:30,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:30,223 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 19:59:30,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:30,224 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 19:59:30,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:30,224 INFO L87 Difference]: Start difference. First operand 25036 states and 44860 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-16 19:59:32,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:32,007 INFO L93 Difference]: Finished difference Result 79502 states and 149057 transitions. [2025-03-16 19:59:32,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 19:59:32,007 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-16 19:59:32,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:32,213 INFO L225 Difference]: With dead ends: 79502 [2025-03-16 19:59:32,213 INFO L226 Difference]: Without dead ends: 56601 [2025-03-16 19:59:32,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-16 19:59:32,289 INFO L435 NwaCegarLoop]: 4289 mSDtfsCounter, 4886 mSDsluCounter, 12995 mSDsCounter, 0 mSdLazyCounter, 638 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4911 SdHoareTripleChecker+Valid, 17284 SdHoareTripleChecker+Invalid, 687 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:32,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4911 Valid, 17284 Invalid, 687 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:59:32,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56601 states. [2025-03-16 19:59:34,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56601 to 53292. [2025-03-16 19:59:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53292 states, 48386 states have (on average 1.6968957963047162) internal successors, (82106), 50448 states have internal predecessors, (82106), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-03-16 19:59:35,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53292 states to 53292 states and 102630 transitions. [2025-03-16 19:59:35,305 INFO L78 Accepts]: Start accepts. Automaton has 53292 states and 102630 transitions. Word has length 121 [2025-03-16 19:59:35,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 19:59:35,305 INFO L471 AbstractCegarLoop]: Abstraction has 53292 states and 102630 transitions. [2025-03-16 19:59:35,306 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-16 19:59:35,306 INFO L276 IsEmpty]: Start isEmpty. Operand 53292 states and 102630 transitions. [2025-03-16 19:59:35,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-16 19:59:35,324 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 19:59:35,325 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-16 19:59:35,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 19:59:35,325 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 19:59:35,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 19:59:35,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1829463511, now seen corresponding path program 1 times [2025-03-16 19:59:35,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 19:59:35,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009282458] [2025-03-16 19:59:35,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 19:59:35,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 19:59:35,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-16 19:59:35,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-16 19:59:35,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 19:59:35,341 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 19:59:35,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 19:59:35,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 19:59:35,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009282458] [2025-03-16 19:59:35,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009282458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 19:59:35,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 19:59:35,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 19:59:35,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475323703] [2025-03-16 19:59:35,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 19:59:35,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 19:59:35,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 19:59:35,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 19:59:35,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 19:59:35,419 INFO L87 Difference]: Start difference. First operand 53292 states and 102630 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-16 19:59:38,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 19:59:38,278 INFO L93 Difference]: Finished difference Result 119772 states and 242001 transitions. [2025-03-16 19:59:38,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 19:59:38,279 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-16 19:59:38,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 19:59:38,577 INFO L225 Difference]: With dead ends: 119772 [2025-03-16 19:59:38,577 INFO L226 Difference]: Without dead ends: 68615 [2025-03-16 19:59:38,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 19:59:38,727 INFO L435 NwaCegarLoop]: 4248 mSDtfsCounter, 4491 mSDsluCounter, 8383 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4507 SdHoareTripleChecker+Valid, 12631 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 19:59:38,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4507 Valid, 12631 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 19:59:38,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68615 states.