./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label48+token_ring.07.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label48+token_ring.07.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 40c1e0608e097577ee5e32b08b857d6e2e7eb2349b5c9e07b4711539a549ac1d --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:17:44,993 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:17:45,027 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 17:17:45,031 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:17:45,031 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:17:45,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:17:45,045 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:17:45,045 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:17:45,046 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:17:45,046 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:17:45,046 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:17:45,046 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:17:45,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:17:45,046 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:17:45,046 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:17:45,046 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:17:45,047 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:17:45,047 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:17:45,047 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:17:45,047 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:17:45,047 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:17:45,047 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:17:45,047 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:17:45,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:17:45,047 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:17:45,047 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:17:45,047 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:17:45,047 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:17:45,048 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:17:45,048 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:17:45,048 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:17:45,048 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:17:45,048 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:17:45,048 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:17:45,048 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:17:45,048 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:17:45,048 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:17:45,048 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:17:45,049 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:17:45,049 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:17:45,049 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:17:45,049 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:17:45,049 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:17:45,049 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-jdk21/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 -> 40c1e0608e097577ee5e32b08b857d6e2e7eb2349b5c9e07b4711539a549ac1d [2025-02-05 17:17:45,255 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:17:45,261 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:17:45,262 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:17:45,263 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:17:45,263 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:17:45,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label48+token_ring.07.cil-1.c [2025-02-05 17:17:46,401 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7738a872/038d58042b9640aca772ab3d8f67ca51/FLAG294b58047 [2025-02-05 17:17:46,986 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:17:46,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.07.cil-1.c [2025-02-05 17:17:47,034 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7738a872/038d58042b9640aca772ab3d8f67ca51/FLAG294b58047 [2025-02-05 17:17:47,494 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a7738a872/038d58042b9640aca772ab3d8f67ca51 [2025-02-05 17:17:47,497 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:17:47,500 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:17:47,502 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:17:47,502 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:17:47,505 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:17:47,505 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:17:47" (1/1) ... [2025-02-05 17:17:47,508 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60f6301 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:47, skipping insertion in model container [2025-02-05 17:17:47,508 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:17:47" (1/1) ... [2025-02-05 17:17:47,667 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:17:48,920 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.07.cil-1.c[375709,375722] [2025-02-05 17:17:48,951 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.07.cil-1.c[383339,383352] [2025-02-05 17:17:49,141 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:17:49,149 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:17:49,636 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.07.cil-1.c[375709,375722] [2025-02-05 17:17:49,645 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label48+token_ring.07.cil-1.c[383339,383352] [2025-02-05 17:17:49,663 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:17:49,711 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:17:49,712 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:49 WrapperNode [2025-02-05 17:17:49,713 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:17:49,714 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:17:49,714 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:17:49,715 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:17:49,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:49" (1/1) ... [2025-02-05 17:17:49,781 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:49" (1/1) ... [2025-02-05 17:17:50,083 INFO L138 Inliner]: procedures = 58, calls = 62, calls flagged for inlining = 36, calls inlined = 36, statements flattened = 12900 [2025-02-05 17:17:50,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:17:50,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:17:50,085 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:17:50,085 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:17:50,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:49" (1/1) ... [2025-02-05 17:17:50,092 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:49" (1/1) ... [2025-02-05 17:17:50,252 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:49" (1/1) ... [2025-02-05 17:17:50,332 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-02-05 17:17:50,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:49" (1/1) ... [2025-02-05 17:17:50,333 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:49" (1/1) ... [2025-02-05 17:17:50,481 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:49" (1/1) ... [2025-02-05 17:17:50,495 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:49" (1/1) ... [2025-02-05 17:17:50,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:49" (1/1) ... [2025-02-05 17:17:50,537 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:49" (1/1) ... [2025-02-05 17:17:50,575 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:17:50,577 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:17:50,577 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:17:50,577 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:17:50,578 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:49" (1/1) ... [2025-02-05 17:17:50,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:17:50,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:17:50,603 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 17:17:50,611 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 17:17:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:17:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:17:50,629 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:17:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:17:50,629 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:17:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:17:50,629 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:17:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:17:50,629 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:17:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:17:50,629 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:17:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:17:50,629 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:17:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:17:50,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:17:50,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:17:50,733 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:17:50,735 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:17:57,094 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:17:57,095 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:17:57,095 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:17:57,095 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:17:57,096 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:17:57,096 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:17:57,097 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:17:57,286 INFO L? ?]: Removed 1725 outVars from TransFormulas that were not future-live. [2025-02-05 17:17:57,286 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:17:57,345 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:17:57,346 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:17:57,346 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:17:57 BoogieIcfgContainer [2025-02-05 17:17:57,347 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:17:57,348 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:17:57,349 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:17:57,352 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:17:57,352 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:17:47" (1/3) ... [2025-02-05 17:17:57,352 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8792d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:17:57, skipping insertion in model container [2025-02-05 17:17:57,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:17:49" (2/3) ... [2025-02-05 17:17:57,353 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d8792d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:17:57, skipping insertion in model container [2025-02-05 17:17:57,353 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:17:57" (3/3) ... [2025-02-05 17:17:57,354 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label48+token_ring.07.cil-1.c [2025-02-05 17:17:57,365 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:17:57,369 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label48+token_ring.07.cil-1.c that has 7 procedures, 2456 locations, 1 initial locations, 11 loop locations, and 2 error locations. [2025-02-05 17:17:57,458 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:17:57,468 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;@17e00143, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:17:57,469 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:17:57,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 2456 states, 2426 states have (on average 1.8396537510305029) internal successors, (4463), 2429 states have internal predecessors, (4463), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-05 17:17:57,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:17:57,493 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:17:57,494 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:17:57,494 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:17:57,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:17:57,498 INFO L85 PathProgramCache]: Analyzing trace with hash 306970183, now seen corresponding path program 1 times [2025-02-05 17:17:57,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:17:57,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621615980] [2025-02-05 17:17:57,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:17:57,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:17:57,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:17:57,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:17:57,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:17:57,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:17:57,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:17:57,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:17:57,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621615980] [2025-02-05 17:17:57,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621615980] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:17:57,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:17:57,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:17:57,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392784013] [2025-02-05 17:17:57,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:17:58,001 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:17:58,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:17:58,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:17:58,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:17:58,028 INFO L87 Difference]: Start difference. First operand has 2456 states, 2426 states have (on average 1.8396537510305029) internal successors, (4463), 2429 states have internal predecessors, (4463), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:17:58,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:17:58,456 INFO L93 Difference]: Finished difference Result 4911 states and 9015 transitions. [2025-02-05 17:17:58,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:17:58,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:17:58,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:17:58,483 INFO L225 Difference]: With dead ends: 4911 [2025-02-05 17:17:58,484 INFO L226 Difference]: Without dead ends: 2405 [2025-02-05 17:17:58,494 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-02-05 17:17:58,496 INFO L435 NwaCegarLoop]: 4332 mSDtfsCounter, 4559 mSDsluCounter, 8559 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4574 SdHoareTripleChecker+Valid, 12891 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:17:58,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4574 Valid, 12891 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:17:58,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2025-02-05 17:17:58,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2389. [2025-02-05 17:17:58,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2389 states, 2360 states have (on average 1.8309322033898305) internal successors, (4321), 2362 states have internal predecessors, (4321), 21 states have call successors, (21), 6 states have call predecessors, (21), 6 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2025-02-05 17:17:58,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2389 states to 2389 states and 4363 transitions. [2025-02-05 17:17:58,743 INFO L78 Accepts]: Start accepts. Automaton has 2389 states and 4363 transitions. Word has length 123 [2025-02-05 17:17:58,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:17:58,744 INFO L471 AbstractCegarLoop]: Abstraction has 2389 states and 4363 transitions. [2025-02-05 17:17:58,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:17:58,744 INFO L276 IsEmpty]: Start isEmpty. Operand 2389 states and 4363 transitions. [2025-02-05 17:17:58,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:17:58,747 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:17:58,747 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:17:58,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:17:58,747 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:17:58,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:17:58,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1001617190, now seen corresponding path program 1 times [2025-02-05 17:17:58,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:17:58,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256276727] [2025-02-05 17:17:58,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:17:58,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:17:58,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:17:58,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:17:58,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:17:58,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:17:59,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:17:59,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:17:59,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256276727] [2025-02-05 17:17:59,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256276727] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:17:59,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:17:59,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:17:59,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046687092] [2025-02-05 17:17:59,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:17:59,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:17:59,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:17:59,008 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:17:59,009 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:17:59,009 INFO L87 Difference]: Start difference. First operand 2389 states and 4363 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:17:59,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:17:59,558 INFO L93 Difference]: Finished difference Result 2939 states and 5215 transitions. [2025-02-05 17:17:59,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:17:59,558 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:17:59,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:17:59,569 INFO L225 Difference]: With dead ends: 2939 [2025-02-05 17:17:59,570 INFO L226 Difference]: Without dead ends: 2686 [2025-02-05 17:17:59,571 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-02-05 17:17:59,572 INFO L435 NwaCegarLoop]: 4491 mSDtfsCounter, 4692 mSDsluCounter, 13585 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4707 SdHoareTripleChecker+Valid, 18076 SdHoareTripleChecker+Invalid, 798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:17:59,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4707 Valid, 18076 Invalid, 798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:17:59,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2025-02-05 17:17:59,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2654. [2025-02-05 17:17:59,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2654 states, 2599 states have (on average 1.8033859176606386) internal successors, (4687), 2603 states have internal predecessors, (4687), 39 states have call successors, (39), 12 states have call predecessors, (39), 14 states have return successors, (46), 40 states have call predecessors, (46), 39 states have call successors, (46) [2025-02-05 17:17:59,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2654 states to 2654 states and 4772 transitions. [2025-02-05 17:17:59,634 INFO L78 Accepts]: Start accepts. Automaton has 2654 states and 4772 transitions. Word has length 123 [2025-02-05 17:17:59,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:17:59,634 INFO L471 AbstractCegarLoop]: Abstraction has 2654 states and 4772 transitions. [2025-02-05 17:17:59,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:17:59,635 INFO L276 IsEmpty]: Start isEmpty. Operand 2654 states and 4772 transitions. [2025-02-05 17:17:59,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:17:59,638 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:17:59,638 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:17:59,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:17:59,638 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:17:59,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:17:59,639 INFO L85 PathProgramCache]: Analyzing trace with hash 2132403815, now seen corresponding path program 1 times [2025-02-05 17:17:59,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:17:59,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668669739] [2025-02-05 17:17:59,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:17:59,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:17:59,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:17:59,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:17:59,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:17:59,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:17:59,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:17:59,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:17:59,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668669739] [2025-02-05 17:17:59,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1668669739] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:17:59,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:17:59,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:17:59,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260707651] [2025-02-05 17:17:59,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:17:59,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:17:59,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:17:59,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:17:59,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:17:59,805 INFO L87 Difference]: Start difference. First operand 2654 states and 4772 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:00,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:00,299 INFO L93 Difference]: Finished difference Result 3730 states and 6437 transitions. [2025-02-05 17:18:00,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:00,299 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:18:00,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:00,312 INFO L225 Difference]: With dead ends: 3730 [2025-02-05 17:18:00,312 INFO L226 Difference]: Without dead ends: 3214 [2025-02-05 17:18:00,314 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-02-05 17:18:00,316 INFO L435 NwaCegarLoop]: 4455 mSDtfsCounter, 4688 mSDsluCounter, 13509 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4703 SdHoareTripleChecker+Valid, 17964 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:00,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4703 Valid, 17964 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:18:00,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3214 states. [2025-02-05 17:18:00,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3214 to 3170. [2025-02-05 17:18:00,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3170 states, 3067 states have (on average 1.7606781871535702) internal successors, (5400), 3075 states have internal predecessors, (5400), 71 states have call successors, (71), 24 states have call predecessors, (71), 30 states have return successors, (94), 74 states have call predecessors, (94), 71 states have call successors, (94) [2025-02-05 17:18:00,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 5565 transitions. [2025-02-05 17:18:00,395 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 5565 transitions. Word has length 123 [2025-02-05 17:18:00,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:00,396 INFO L471 AbstractCegarLoop]: Abstraction has 3170 states and 5565 transitions. [2025-02-05 17:18:00,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:00,396 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 5565 transitions. [2025-02-05 17:18:00,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:18:00,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:00,398 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:00,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:18:00,398 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:00,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:00,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1199049478, now seen corresponding path program 1 times [2025-02-05 17:18:00,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:00,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202398694] [2025-02-05 17:18:00,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:00,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:00,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:18:00,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:18:00,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:00,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:00,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:00,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:00,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202398694] [2025-02-05 17:18:00,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202398694] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:00,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:00,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:00,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777148268] [2025-02-05 17:18:00,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:00,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:00,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:00,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:00,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:00,524 INFO L87 Difference]: Start difference. First operand 3170 states and 5565 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:01,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:01,156 INFO L93 Difference]: Finished difference Result 5375 states and 9016 transitions. [2025-02-05 17:18:01,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:01,157 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:18:01,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:01,178 INFO L225 Difference]: With dead ends: 5375 [2025-02-05 17:18:01,178 INFO L226 Difference]: Without dead ends: 4343 [2025-02-05 17:18:01,182 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-02-05 17:18:01,185 INFO L435 NwaCegarLoop]: 4452 mSDtfsCounter, 4683 mSDsluCounter, 13496 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4698 SdHoareTripleChecker+Valid, 17948 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:01,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4698 Valid, 17948 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:18:01,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4343 states. [2025-02-05 17:18:01,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4343 to 4276. [2025-02-05 17:18:01,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4276 states, 4071 states have (on average 1.7081798084008843) internal successors, (6954), 4093 states have internal predecessors, (6954), 135 states have call successors, (135), 48 states have call predecessors, (135), 68 states have return successors, (214), 142 states have call predecessors, (214), 135 states have call successors, (214) [2025-02-05 17:18:01,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4276 states to 4276 states and 7303 transitions. [2025-02-05 17:18:01,342 INFO L78 Accepts]: Start accepts. Automaton has 4276 states and 7303 transitions. Word has length 123 [2025-02-05 17:18:01,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:01,343 INFO L471 AbstractCegarLoop]: Abstraction has 4276 states and 7303 transitions. [2025-02-05 17:18:01,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:01,343 INFO L276 IsEmpty]: Start isEmpty. Operand 4276 states and 7303 transitions. [2025-02-05 17:18:01,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:18:01,347 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:01,347 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:01,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:18:01,347 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:01,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:01,348 INFO L85 PathProgramCache]: Analyzing trace with hash -1602005369, now seen corresponding path program 1 times [2025-02-05 17:18:01,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:01,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361681795] [2025-02-05 17:18:01,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:01,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:01,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:18:01,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:18:01,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:01,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:01,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:01,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:01,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361681795] [2025-02-05 17:18:01,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361681795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:01,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:01,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:01,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267708984] [2025-02-05 17:18:01,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:01,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:01,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:01,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:01,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:01,486 INFO L87 Difference]: Start difference. First operand 4276 states and 7303 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:02,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:02,096 INFO L93 Difference]: Finished difference Result 8942 states and 14770 transitions. [2025-02-05 17:18:02,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:02,097 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:18:02,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:02,124 INFO L225 Difference]: With dead ends: 8942 [2025-02-05 17:18:02,124 INFO L226 Difference]: Without dead ends: 6804 [2025-02-05 17:18:02,133 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-02-05 17:18:02,133 INFO L435 NwaCegarLoop]: 4450 mSDtfsCounter, 4678 mSDsluCounter, 13484 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4693 SdHoareTripleChecker+Valid, 17934 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:02,134 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4693 Valid, 17934 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 721 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:18:02,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6804 states. [2025-02-05 17:18:02,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6804 to 6694. [2025-02-05 17:18:02,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6694 states, 6267 states have (on average 1.6620392532312112) internal successors, (10416), 6335 states have internal predecessors, (10416), 263 states have call successors, (263), 96 states have call predecessors, (263), 162 states have return successors, (550), 278 states have call predecessors, (550), 263 states have call successors, (550) [2025-02-05 17:18:02,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6694 states to 6694 states and 11229 transitions. [2025-02-05 17:18:02,317 INFO L78 Accepts]: Start accepts. Automaton has 6694 states and 11229 transitions. Word has length 123 [2025-02-05 17:18:02,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:02,317 INFO L471 AbstractCegarLoop]: Abstraction has 6694 states and 11229 transitions. [2025-02-05 17:18:02,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:02,317 INFO L276 IsEmpty]: Start isEmpty. Operand 6694 states and 11229 transitions. [2025-02-05 17:18:02,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:18:02,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:02,324 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:02,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:18:02,325 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:02,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:02,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1494226662, now seen corresponding path program 1 times [2025-02-05 17:18:02,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:02,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022813994] [2025-02-05 17:18:02,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:02,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:02,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:18:02,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:18:02,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:02,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:02,455 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:02,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:02,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022813994] [2025-02-05 17:18:02,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022813994] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:02,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:02,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:02,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764464925] [2025-02-05 17:18:02,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:02,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:02,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:02,457 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:02,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:02,457 INFO L87 Difference]: Start difference. First operand 6694 states and 11229 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:03,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:03,122 INFO L93 Difference]: Finished difference Result 16841 states and 28060 transitions. [2025-02-05 17:18:03,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:03,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:18:03,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:03,175 INFO L225 Difference]: With dead ends: 16841 [2025-02-05 17:18:03,175 INFO L226 Difference]: Without dead ends: 12285 [2025-02-05 17:18:03,189 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-02-05 17:18:03,190 INFO L435 NwaCegarLoop]: 4449 mSDtfsCounter, 4673 mSDsluCounter, 13473 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4688 SdHoareTripleChecker+Valid, 17922 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:03,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4688 Valid, 17922 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:18:03,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12285 states. [2025-02-05 17:18:03,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12285 to 12096. [2025-02-05 17:18:03,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12096 states, 11171 states have (on average 1.6383492972876197) internal successors, (18302), 11385 states have internal predecessors, (18302), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-02-05 17:18:03,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12096 states to 12096 states and 20427 transitions. [2025-02-05 17:18:03,533 INFO L78 Accepts]: Start accepts. Automaton has 12096 states and 20427 transitions. Word has length 123 [2025-02-05 17:18:03,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:03,534 INFO L471 AbstractCegarLoop]: Abstraction has 12096 states and 20427 transitions. [2025-02-05 17:18:03,535 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:03,535 INFO L276 IsEmpty]: Start isEmpty. Operand 12096 states and 20427 transitions. [2025-02-05 17:18:03,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:18:03,541 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:03,541 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:03,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:18:03,541 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:03,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:03,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2009747111, now seen corresponding path program 1 times [2025-02-05 17:18:03,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:03,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1121202713] [2025-02-05 17:18:03,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:03,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:03,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:18:03,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:18:03,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:03,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:03,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:03,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:03,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1121202713] [2025-02-05 17:18:03,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1121202713] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:03,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:03,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:03,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248359186] [2025-02-05 17:18:03,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:03,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:03,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:03,615 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:03,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:03,615 INFO L87 Difference]: Start difference. First operand 12096 states and 20427 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:04,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:04,142 INFO L93 Difference]: Finished difference Result 24486 states and 42155 transitions. [2025-02-05 17:18:04,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:18:04,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:18:04,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:04,196 INFO L225 Difference]: With dead ends: 24486 [2025-02-05 17:18:04,196 INFO L226 Difference]: Without dead ends: 14526 [2025-02-05 17:18:04,219 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-02-05 17:18:04,221 INFO L435 NwaCegarLoop]: 4252 mSDtfsCounter, 4484 mSDsluCounter, 8400 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4499 SdHoareTripleChecker+Valid, 12652 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:04,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4499 Valid, 12652 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:18:04,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14526 states. [2025-02-05 17:18:04,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14526 to 12096. [2025-02-05 17:18:04,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12096 states, 11171 states have (on average 1.6353952197654642) internal successors, (18269), 11385 states have internal predecessors, (18269), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-02-05 17:18:04,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12096 states to 12096 states and 20394 transitions. [2025-02-05 17:18:04,640 INFO L78 Accepts]: Start accepts. Automaton has 12096 states and 20394 transitions. Word has length 123 [2025-02-05 17:18:04,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:04,641 INFO L471 AbstractCegarLoop]: Abstraction has 12096 states and 20394 transitions. [2025-02-05 17:18:04,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:04,641 INFO L276 IsEmpty]: Start isEmpty. Operand 12096 states and 20394 transitions. [2025-02-05 17:18:04,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:18:04,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:04,648 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:04,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:18:04,648 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:04,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:04,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1056545478, now seen corresponding path program 1 times [2025-02-05 17:18:04,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:04,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022798164] [2025-02-05 17:18:04,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:04,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:04,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:18:04,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:18:04,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:04,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:04,728 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:04,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:04,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022798164] [2025-02-05 17:18:04,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022798164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:04,729 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:04,729 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:04,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839049530] [2025-02-05 17:18:04,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:04,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:04,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:04,730 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:04,730 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:04,730 INFO L87 Difference]: Start difference. First operand 12096 states and 20394 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:05,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:05,268 INFO L93 Difference]: Finished difference Result 24000 states and 41117 transitions. [2025-02-05 17:18:05,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:18:05,268 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:18:05,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:05,313 INFO L225 Difference]: With dead ends: 24000 [2025-02-05 17:18:05,313 INFO L226 Difference]: Without dead ends: 14040 [2025-02-05 17:18:05,338 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-02-05 17:18:05,339 INFO L435 NwaCegarLoop]: 4247 mSDtfsCounter, 4478 mSDsluCounter, 8389 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4493 SdHoareTripleChecker+Valid, 12636 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:05,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4493 Valid, 12636 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:18:05,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14040 states. [2025-02-05 17:18:05,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14040 to 12096. [2025-02-05 17:18:05,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12096 states, 11171 states have (on average 1.6324411422433085) internal successors, (18236), 11385 states have internal predecessors, (18236), 519 states have call successors, (519), 192 states have call predecessors, (519), 404 states have return successors, (1606), 550 states have call predecessors, (1606), 519 states have call successors, (1606) [2025-02-05 17:18:05,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12096 states to 12096 states and 20361 transitions. [2025-02-05 17:18:05,708 INFO L78 Accepts]: Start accepts. Automaton has 12096 states and 20361 transitions. Word has length 123 [2025-02-05 17:18:05,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:05,709 INFO L471 AbstractCegarLoop]: Abstraction has 12096 states and 20361 transitions. [2025-02-05 17:18:05,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:05,709 INFO L276 IsEmpty]: Start isEmpty. Operand 12096 states and 20361 transitions. [2025-02-05 17:18:05,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:18:05,714 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:05,714 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:05,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:18:05,715 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:05,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:05,715 INFO L85 PathProgramCache]: Analyzing trace with hash 528179877, now seen corresponding path program 1 times [2025-02-05 17:18:05,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:05,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218013156] [2025-02-05 17:18:05,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:05,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:05,721 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:18:05,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:18:05,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:05,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:05,879 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:05,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:05,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218013156] [2025-02-05 17:18:05,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218013156] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:05,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:05,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:05,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993031397] [2025-02-05 17:18:05,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:05,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:05,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:05,881 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:05,881 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:05,881 INFO L87 Difference]: Start difference. First operand 12096 states and 20361 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:07,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:07,094 INFO L93 Difference]: Finished difference Result 35183 states and 60205 transitions. [2025-02-05 17:18:07,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:07,095 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:18:07,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:07,191 INFO L225 Difference]: With dead ends: 35183 [2025-02-05 17:18:07,191 INFO L226 Difference]: Without dead ends: 25225 [2025-02-05 17:18:07,227 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-02-05 17:18:07,228 INFO L435 NwaCegarLoop]: 4435 mSDtfsCounter, 4814 mSDsluCounter, 13406 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4837 SdHoareTripleChecker+Valid, 17841 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:07,228 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4837 Valid, 17841 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:18:07,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25225 states. [2025-02-05 17:18:08,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25225 to 23616. [2025-02-05 17:18:08,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23616 states, 21565 states have (on average 1.6230929747275677) internal successors, (35002), 22233 states have internal predecessors, (35002), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-02-05 17:18:08,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23616 states to 23616 states and 41223 transitions. [2025-02-05 17:18:08,341 INFO L78 Accepts]: Start accepts. Automaton has 23616 states and 41223 transitions. Word has length 123 [2025-02-05 17:18:08,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:08,342 INFO L471 AbstractCegarLoop]: Abstraction has 23616 states and 41223 transitions. [2025-02-05 17:18:08,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:08,342 INFO L276 IsEmpty]: Start isEmpty. Operand 23616 states and 41223 transitions. [2025-02-05 17:18:08,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:18:08,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:08,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:08,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:18:08,351 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:08,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:08,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1203872486, now seen corresponding path program 1 times [2025-02-05 17:18:08,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:08,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362150106] [2025-02-05 17:18:08,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:08,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:08,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:18:08,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:18:08,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:08,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:08,412 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:08,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:08,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362150106] [2025-02-05 17:18:08,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362150106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:08,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:08,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:08,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857690009] [2025-02-05 17:18:08,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:08,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:08,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:08,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:08,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:08,413 INFO L87 Difference]: Start difference. First operand 23616 states and 41223 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:09,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:09,444 INFO L93 Difference]: Finished difference Result 49470 states and 89377 transitions. [2025-02-05 17:18:09,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:18:09,445 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:18:09,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:09,535 INFO L225 Difference]: With dead ends: 49470 [2025-02-05 17:18:09,535 INFO L226 Difference]: Without dead ends: 27990 [2025-02-05 17:18:09,576 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-02-05 17:18:09,577 INFO L435 NwaCegarLoop]: 4242 mSDtfsCounter, 4474 mSDsluCounter, 8380 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4489 SdHoareTripleChecker+Valid, 12622 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:09,577 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4489 Valid, 12622 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:18:09,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27990 states. [2025-02-05 17:18:11,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27990 to 23616. [2025-02-05 17:18:11,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23616 states, 21565 states have (on average 1.6200788314398331) internal successors, (34937), 22233 states have internal predecessors, (34937), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-02-05 17:18:11,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23616 states to 23616 states and 41158 transitions. [2025-02-05 17:18:11,364 INFO L78 Accepts]: Start accepts. Automaton has 23616 states and 41158 transitions. Word has length 123 [2025-02-05 17:18:11,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:11,364 INFO L471 AbstractCegarLoop]: Abstraction has 23616 states and 41158 transitions. [2025-02-05 17:18:11,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:11,365 INFO L276 IsEmpty]: Start isEmpty. Operand 23616 states and 41158 transitions. [2025-02-05 17:18:11,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:18:11,373 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:11,373 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:11,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:18:11,374 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:11,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:11,374 INFO L85 PathProgramCache]: Analyzing trace with hash 394385029, now seen corresponding path program 1 times [2025-02-05 17:18:11,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:11,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480276272] [2025-02-05 17:18:11,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:11,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:11,384 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:18:11,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:18:11,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:11,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:11,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:11,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:11,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480276272] [2025-02-05 17:18:11,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480276272] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:11,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:11,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:11,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620069814] [2025-02-05 17:18:11,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:11,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:11,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:11,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:11,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:11,454 INFO L87 Difference]: Start difference. First operand 23616 states and 41158 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:12,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:12,413 INFO L93 Difference]: Finished difference Result 48741 states and 87789 transitions. [2025-02-05 17:18:12,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:18:12,413 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:18:12,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:12,675 INFO L225 Difference]: With dead ends: 48741 [2025-02-05 17:18:12,675 INFO L226 Difference]: Without dead ends: 27261 [2025-02-05 17:18:12,706 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-02-05 17:18:12,708 INFO L435 NwaCegarLoop]: 4239 mSDtfsCounter, 4471 mSDsluCounter, 8375 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4486 SdHoareTripleChecker+Valid, 12614 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:12,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4486 Valid, 12614 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:18:12,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27261 states. [2025-02-05 17:18:13,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27261 to 23616. [2025-02-05 17:18:13,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23616 states, 21565 states have (on average 1.6170646881520983) internal successors, (34872), 22233 states have internal predecessors, (34872), 999 states have call successors, (999), 384 states have call predecessors, (999), 1050 states have return successors, (5222), 1062 states have call predecessors, (5222), 999 states have call successors, (5222) [2025-02-05 17:18:14,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23616 states to 23616 states and 41093 transitions. [2025-02-05 17:18:14,030 INFO L78 Accepts]: Start accepts. Automaton has 23616 states and 41093 transitions. Word has length 123 [2025-02-05 17:18:14,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:14,030 INFO L471 AbstractCegarLoop]: Abstraction has 23616 states and 41093 transitions. [2025-02-05 17:18:14,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 23616 states and 41093 transitions. [2025-02-05 17:18:14,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:18:14,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:14,040 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:14,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:18:14,041 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:14,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:14,041 INFO L85 PathProgramCache]: Analyzing trace with hash -47369466, now seen corresponding path program 1 times [2025-02-05 17:18:14,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:14,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447355654] [2025-02-05 17:18:14,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:14,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:14,049 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:18:14,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:18:14,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:14,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:14,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:14,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:14,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447355654] [2025-02-05 17:18:14,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447355654] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:14,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:14,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:14,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353135513] [2025-02-05 17:18:14,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:14,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:14,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:14,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:14,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:14,138 INFO L87 Difference]: Start difference. First operand 23616 states and 41093 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:16,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:16,233 INFO L93 Difference]: Finished difference Result 70918 states and 129599 transitions. [2025-02-05 17:18:16,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:18:16,233 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:18:16,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:16,406 INFO L225 Difference]: With dead ends: 70918 [2025-02-05 17:18:16,406 INFO L226 Difference]: Without dead ends: 49440 [2025-02-05 17:18:16,460 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-02-05 17:18:16,462 INFO L435 NwaCegarLoop]: 4421 mSDtfsCounter, 4703 mSDsluCounter, 13351 mSDsCounter, 0 mSdLazyCounter, 730 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4726 SdHoareTripleChecker+Valid, 17772 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:16,462 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4726 Valid, 17772 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 730 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:18:16,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49440 states. [2025-02-05 17:18:19,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49440 to 47770. [2025-02-05 17:18:19,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47770 states, 43013 states have (on average 1.6074675098226117) internal successors, (69142), 45075 states have internal predecessors, (69142), 1927 states have call successors, (1927), 768 states have call predecessors, (1927), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-02-05 17:18:19,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47770 states to 47770 states and 89635 transitions. [2025-02-05 17:18:19,333 INFO L78 Accepts]: Start accepts. Automaton has 47770 states and 89635 transitions. Word has length 123 [2025-02-05 17:18:19,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:19,333 INFO L471 AbstractCegarLoop]: Abstraction has 47770 states and 89635 transitions. [2025-02-05 17:18:19,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 47770 states and 89635 transitions. [2025-02-05 17:18:19,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:18:19,353 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:19,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:19,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:18:19,353 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:19,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:19,357 INFO L85 PathProgramCache]: Analyzing trace with hash -61619611, now seen corresponding path program 1 times [2025-02-05 17:18:19,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:19,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148642122] [2025-02-05 17:18:19,357 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:19,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:19,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:18:19,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:18:19,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:19,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:19,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:19,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:19,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148642122] [2025-02-05 17:18:19,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148642122] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:19,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:19,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:18:19,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732879874] [2025-02-05 17:18:19,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:19,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:18:19,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:19,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:18:19,415 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:18:19,415 INFO L87 Difference]: Start difference. First operand 47770 states and 89635 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:21,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:18:21,638 INFO L93 Difference]: Finished difference Result 99965 states and 198745 transitions. [2025-02-05 17:18:21,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:18:21,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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 123 [2025-02-05 17:18:21,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:18:21,852 INFO L225 Difference]: With dead ends: 99965 [2025-02-05 17:18:21,853 INFO L226 Difference]: Without dead ends: 54331 [2025-02-05 17:18:21,966 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-02-05 17:18:21,966 INFO L435 NwaCegarLoop]: 4234 mSDtfsCounter, 4467 mSDsluCounter, 8366 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4482 SdHoareTripleChecker+Valid, 12600 SdHoareTripleChecker+Invalid, 336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:18:21,967 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4482 Valid, 12600 Invalid, 336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:18:21,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54331 states. [2025-02-05 17:18:26,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54331 to 47770. [2025-02-05 17:18:26,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47770 states, 43013 states have (on average 1.6044684165252365) internal successors, (69013), 45075 states have internal predecessors, (69013), 1927 states have call successors, (1927), 768 states have call predecessors, (1927), 2828 states have return successors, (18566), 2054 states have call predecessors, (18566), 1927 states have call successors, (18566) [2025-02-05 17:18:26,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47770 states to 47770 states and 89506 transitions. [2025-02-05 17:18:26,995 INFO L78 Accepts]: Start accepts. Automaton has 47770 states and 89506 transitions. Word has length 123 [2025-02-05 17:18:26,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:18:26,996 INFO L471 AbstractCegarLoop]: Abstraction has 47770 states and 89506 transitions. [2025-02-05 17:18:26,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 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-02-05 17:18:26,996 INFO L276 IsEmpty]: Start isEmpty. Operand 47770 states and 89506 transitions. [2025-02-05 17:18:27,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-02-05 17:18:27,010 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:18:27,010 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:18:27,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 17:18:27,010 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:18:27,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:18:27,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1031910618, now seen corresponding path program 1 times [2025-02-05 17:18:27,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:18:27,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000286152] [2025-02-05 17:18:27,011 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:18:27,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:18:27,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-02-05 17:18:27,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-02-05 17:18:27,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:18:27,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:18:27,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 17:18:27,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:18:27,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000286152] [2025-02-05 17:18:27,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000286152] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:18:27,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:18:27,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:18:27,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396737623] [2025-02-05 17:18:27,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:18:27,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:18:27,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:18:27,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:18:27,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:18:27,077 INFO L87 Difference]: Start difference. First operand 47770 states and 89506 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 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)