./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label47+token_ring.08.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_label47+token_ring.08.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 d4567c6a74ac7eac1fa65db4db5999d3a1dd022fa97829ecd98c8e766f1d922f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:16:40,876 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:16:40,917 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:16:40,920 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:16:40,920 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:16:40,934 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:16:40,934 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:16:40,934 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:16:40,935 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:16:40,935 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:16:40,935 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:16:40,935 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:16:40,935 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:16:40,935 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:16:40,935 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:16:40,935 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:16:40,936 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:16:40,936 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:16:40,936 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:16:40,936 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:16:40,936 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:16:40,936 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:16:40,936 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:16:40,936 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:16:40,936 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:16:40,936 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:16:40,936 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:16:40,937 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:16:40,937 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:16:40,937 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:16:40,937 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:16:40,937 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:16:40,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:16:40,937 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:16:40,937 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:16:40,937 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:16:40,937 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:16:40,937 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:16:40,937 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:16:40,938 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:16:40,938 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:16:40,938 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:16:40,938 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:16:40,938 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 -> d4567c6a74ac7eac1fa65db4db5999d3a1dd022fa97829ecd98c8e766f1d922f [2025-02-05 17:16:41,120 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:16:41,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:16:41,137 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:16:41,138 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:16:41,139 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:16:41,140 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label47+token_ring.08.cil-1.c [2025-02-05 17:16:42,461 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c7ffb47e9/cfde5ea09f18466991d0a087bfa33422/FLAG924a2526f [2025-02-05 17:16:43,075 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:16:43,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label47+token_ring.08.cil-1.c [2025-02-05 17:16:43,121 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c7ffb47e9/cfde5ea09f18466991d0a087bfa33422/FLAG924a2526f [2025-02-05 17:16:43,135 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c7ffb47e9/cfde5ea09f18466991d0a087bfa33422 [2025-02-05 17:16:43,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:16:43,138 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:16:43,140 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:16:43,140 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:16:43,142 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:16:43,143 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:16:43" (1/1) ... [2025-02-05 17:16:43,145 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a7640c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:43, skipping insertion in model container [2025-02-05 17:16:43,145 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:16:43" (1/1) ... [2025-02-05 17:16:43,271 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:16:44,439 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_label47+token_ring.08.cil-1.c[377612,377625] [2025-02-05 17:16:44,468 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_label47+token_ring.08.cil-1.c[383339,383352] [2025-02-05 17:16:44,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:16:44,632 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:16:45,153 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_label47+token_ring.08.cil-1.c[377612,377625] [2025-02-05 17:16:45,159 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_label47+token_ring.08.cil-1.c[383339,383352] [2025-02-05 17:16:45,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:16:45,220 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:16:45,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:45 WrapperNode [2025-02-05 17:16:45,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:16:45,223 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:16:45,223 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:16:45,223 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:16:45,228 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:16:45" (1/1) ... [2025-02-05 17:16:45,279 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:16:45" (1/1) ... [2025-02-05 17:16:45,543 INFO L138 Inliner]: procedures = 60, calls = 65, calls flagged for inlining = 38, calls inlined = 38, statements flattened = 12957 [2025-02-05 17:16:45,545 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:16:45,545 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:16:45,545 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:16:45,545 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:16:45,552 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:45" (1/1) ... [2025-02-05 17:16:45,552 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:45" (1/1) ... [2025-02-05 17:16:45,600 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:45" (1/1) ... [2025-02-05 17:16:45,672 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:16:45,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:45" (1/1) ... [2025-02-05 17:16:45,673 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:45" (1/1) ... [2025-02-05 17:16:45,932 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:45" (1/1) ... [2025-02-05 17:16:45,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:45" (1/1) ... [2025-02-05 17:16:45,966 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:45" (1/1) ... [2025-02-05 17:16:45,982 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:45" (1/1) ... [2025-02-05 17:16:46,096 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:16:46,098 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:16:46,098 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:16:46,098 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:16:46,099 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:45" (1/1) ... [2025-02-05 17:16:46,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:16:46,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:16:46,130 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:16:46,140 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:16:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:16:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:16:46,156 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:16:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:16:46,156 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:16:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:16:46,156 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:16:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:16:46,156 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:16:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:16:46,156 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:16:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:16:46,156 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:16:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:16:46,156 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:16:46,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:16:46,233 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:16:46,234 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:16:53,420 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:16:53,421 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:16:53,421 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:16:53,421 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:16:53,422 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:16:53,423 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:16:53,423 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:16:53,667 INFO L? ?]: Removed 1731 outVars from TransFormulas that were not future-live. [2025-02-05 17:16:53,668 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:16:53,753 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:16:53,753 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:16:53,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:16:53 BoogieIcfgContainer [2025-02-05 17:16:53,754 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:16:53,758 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:16:53,759 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:16:53,763 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:16:53,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:16:43" (1/3) ... [2025-02-05 17:16:53,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e606d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:16:53, skipping insertion in model container [2025-02-05 17:16:53,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:16:45" (2/3) ... [2025-02-05 17:16:53,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15e606d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:16:53, skipping insertion in model container [2025-02-05 17:16:53,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:16:53" (3/3) ... [2025-02-05 17:16:53,765 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label47+token_ring.08.cil-1.c [2025-02-05 17:16:53,778 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:16:53,780 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label47+token_ring.08.cil-1.c that has 7 procedures, 2483 locations, 1 initial locations, 12 loop locations, and 2 error locations. [2025-02-05 17:16:53,913 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:16:53,927 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;@2c1a44ab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:16:53,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:16:53,942 INFO L276 IsEmpty]: Start isEmpty. Operand has 2483 states, 2452 states have (on average 1.8372756933115824) internal successors, (4505), 2455 states have internal predecessors, (4505), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2025-02-05 17:16:53,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:16:53,955 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:53,955 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:16:53,956 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:53,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:53,960 INFO L85 PathProgramCache]: Analyzing trace with hash 840339491, now seen corresponding path program 1 times [2025-02-05 17:16:53,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:53,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289199061] [2025-02-05 17:16:53,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:53,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:54,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:16:54,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:16:54,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:54,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:54,531 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:16:54,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:54,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289199061] [2025-02-05 17:16:54,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289199061] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:54,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:54,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:16:54,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573102050] [2025-02-05 17:16:54,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:54,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:16:54,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:54,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:16:54,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:16:54,555 INFO L87 Difference]: Start difference. First operand has 2483 states, 2452 states have (on average 1.8372756933115824) internal successors, (4505), 2455 states have internal predecessors, (4505), 22 states have call successors, (22), 6 states have call predecessors, (22), 6 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 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:16:55,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:55,376 INFO L93 Difference]: Finished difference Result 5264 states and 9573 transitions. [2025-02-05 17:16:55,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:16:55,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 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 134 [2025-02-05 17:16:55,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:55,403 INFO L225 Difference]: With dead ends: 5264 [2025-02-05 17:16:55,403 INFO L226 Difference]: Without dead ends: 2727 [2025-02-05 17:16:55,411 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:16:55,413 INFO L435 NwaCegarLoop]: 4380 mSDtfsCounter, 4854 mSDsluCounter, 8959 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4870 SdHoareTripleChecker+Valid, 13339 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:16:55,413 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4870 Valid, 13339 Invalid, 516 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [48 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:16:55,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2727 states. [2025-02-05 17:16:55,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2727 to 2706. [2025-02-05 17:16:55,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2652 states have (on average 1.7997737556561086) internal successors, (4773), 2655 states have internal predecessors, (4773), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-02-05 17:16:55,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 4852 transitions. [2025-02-05 17:16:55,550 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 4852 transitions. Word has length 134 [2025-02-05 17:16:55,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:55,550 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 4852 transitions. [2025-02-05 17:16:55,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 4 states have internal predecessors, (124), 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:16:55,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 4852 transitions. [2025-02-05 17:16:55,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:16:55,555 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:55,555 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:16:55,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:16:55,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:55,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:55,558 INFO L85 PathProgramCache]: Analyzing trace with hash -12912283, now seen corresponding path program 1 times [2025-02-05 17:16:55,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:55,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [144329530] [2025-02-05 17:16:55,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:55,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:55,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:16:55,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:16:55,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:55,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:55,798 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:16:55,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:55,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [144329530] [2025-02-05 17:16:55,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [144329530] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:55,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:55,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:16:55,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763430539] [2025-02-05 17:16:55,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:55,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:16:55,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:55,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:16:55,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:16:55,802 INFO L87 Difference]: Start difference. First operand 2706 states and 4852 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:16:56,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:56,238 INFO L93 Difference]: Finished difference Result 3329 states and 5825 transitions. [2025-02-05 17:16:56,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:16:56,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:16:56,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:56,249 INFO L225 Difference]: With dead ends: 3329 [2025-02-05 17:16:56,250 INFO L226 Difference]: Without dead ends: 2760 [2025-02-05 17:16:56,252 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:16:56,254 INFO L435 NwaCegarLoop]: 4299 mSDtfsCounter, 4553 mSDsluCounter, 8483 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4569 SdHoareTripleChecker+Valid, 12782 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:16:56,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4569 Valid, 12782 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:16:56,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2760 states. [2025-02-05 17:16:56,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2760 to 2706. [2025-02-05 17:16:56,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2706 states, 2652 states have (on average 1.7990196078431373) internal successors, (4771), 2655 states have internal predecessors, (4771), 39 states have call successors, (39), 12 states have call predecessors, (39), 13 states have return successors, (40), 39 states have call predecessors, (40), 39 states have call successors, (40) [2025-02-05 17:16:56,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2706 states to 2706 states and 4850 transitions. [2025-02-05 17:16:56,398 INFO L78 Accepts]: Start accepts. Automaton has 2706 states and 4850 transitions. Word has length 134 [2025-02-05 17:16:56,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:56,399 INFO L471 AbstractCegarLoop]: Abstraction has 2706 states and 4850 transitions. [2025-02-05 17:16:56,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:16:56,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2706 states and 4850 transitions. [2025-02-05 17:16:56,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:16:56,402 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:56,402 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:16:56,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:16:56,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:56,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:56,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1159452796, now seen corresponding path program 1 times [2025-02-05 17:16:56,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:56,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [867165595] [2025-02-05 17:16:56,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:56,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:56,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:16:56,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:16:56,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:56,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:56,611 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:16:56,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:56,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [867165595] [2025-02-05 17:16:56,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [867165595] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:56,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:56,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:16:56,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739971617] [2025-02-05 17:16:56,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:56,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:16:56,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:56,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:16:56,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:16:56,614 INFO L87 Difference]: Start difference. First operand 2706 states and 4850 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:16:57,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:57,219 INFO L93 Difference]: Finished difference Result 3634 states and 6288 transitions. [2025-02-05 17:16:57,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:16:57,219 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:16:57,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:57,229 INFO L225 Difference]: With dead ends: 3634 [2025-02-05 17:16:57,229 INFO L226 Difference]: Without dead ends: 3065 [2025-02-05 17:16:57,231 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:16:57,231 INFO L435 NwaCegarLoop]: 4548 mSDtfsCounter, 4781 mSDsluCounter, 13683 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4797 SdHoareTripleChecker+Valid, 18231 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:16:57,232 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4797 Valid, 18231 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:16:57,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3065 states. [2025-02-05 17:16:57,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3065 to 2976. [2025-02-05 17:16:57,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2976 states, 2898 states have (on average 1.7736369910282954) internal successors, (5140), 2902 states have internal predecessors, (5140), 56 states have call successors, (56), 18 states have call predecessors, (56), 20 states have return successors, (60), 57 states have call predecessors, (60), 56 states have call successors, (60) [2025-02-05 17:16:57,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 5256 transitions. [2025-02-05 17:16:57,284 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 5256 transitions. Word has length 134 [2025-02-05 17:16:57,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:57,284 INFO L471 AbstractCegarLoop]: Abstraction has 2976 states and 5256 transitions. [2025-02-05 17:16:57,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:16:57,285 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 5256 transitions. [2025-02-05 17:16:57,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:16:57,286 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:57,286 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:16:57,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:16:57,286 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:57,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:57,287 INFO L85 PathProgramCache]: Analyzing trace with hash 1851603333, now seen corresponding path program 1 times [2025-02-05 17:16:57,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:57,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995286493] [2025-02-05 17:16:57,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:57,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:57,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:16:57,297 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:16:57,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:57,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:57,441 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:16:57,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:57,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995286493] [2025-02-05 17:16:57,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995286493] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:57,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:57,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:16:57,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1810004154] [2025-02-05 17:16:57,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:57,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:16:57,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:57,442 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:16:57,442 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:16:57,442 INFO L87 Difference]: Start difference. First operand 2976 states and 5256 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:16:58,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:58,163 INFO L93 Difference]: Finished difference Result 4487 states and 7591 transitions. [2025-02-05 17:16:58,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:16:58,164 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:16:58,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:58,185 INFO L225 Difference]: With dead ends: 4487 [2025-02-05 17:16:58,185 INFO L226 Difference]: Without dead ends: 3648 [2025-02-05 17:16:58,190 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:16:58,192 INFO L435 NwaCegarLoop]: 4544 mSDtfsCounter, 4776 mSDsluCounter, 13671 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4792 SdHoareTripleChecker+Valid, 18215 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:16:58,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4792 Valid, 18215 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:16:58,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2025-02-05 17:16:58,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 3547. [2025-02-05 17:16:58,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3547 states, 3419 states have (on average 1.7353027200935947) internal successors, (5933), 3427 states have internal predecessors, (5933), 90 states have call successors, (90), 30 states have call predecessors, (90), 36 states have return successors, (106), 93 states have call predecessors, (106), 90 states have call successors, (106) [2025-02-05 17:16:58,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3547 states to 3547 states and 6129 transitions. [2025-02-05 17:16:58,304 INFO L78 Accepts]: Start accepts. Automaton has 3547 states and 6129 transitions. Word has length 134 [2025-02-05 17:16:58,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:58,304 INFO L471 AbstractCegarLoop]: Abstraction has 3547 states and 6129 transitions. [2025-02-05 17:16:58,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:16:58,304 INFO L276 IsEmpty]: Start isEmpty. Operand 3547 states and 6129 transitions. [2025-02-05 17:16:58,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:16:58,305 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:58,305 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:16:58,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:16:58,306 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:58,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:58,306 INFO L85 PathProgramCache]: Analyzing trace with hash 2087281508, now seen corresponding path program 1 times [2025-02-05 17:16:58,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:58,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002396574] [2025-02-05 17:16:58,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:58,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:58,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:16:58,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:16:58,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:58,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:58,421 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:16:58,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:58,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002396574] [2025-02-05 17:16:58,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002396574] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:58,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:58,422 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:16:58,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191028836] [2025-02-05 17:16:58,422 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:58,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:16:58,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:58,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:16:58,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:16:58,423 INFO L87 Difference]: Start difference. First operand 3547 states and 6129 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:16:59,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:16:59,144 INFO L93 Difference]: Finished difference Result 6312 states and 10438 transitions. [2025-02-05 17:16:59,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:16:59,144 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:16:59,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:16:59,169 INFO L225 Difference]: With dead ends: 6312 [2025-02-05 17:16:59,169 INFO L226 Difference]: Without dead ends: 4902 [2025-02-05 17:16:59,176 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:16:59,176 INFO L435 NwaCegarLoop]: 4331 mSDtfsCounter, 4797 mSDsluCounter, 13155 mSDsCounter, 0 mSdLazyCounter, 669 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4813 SdHoareTripleChecker+Valid, 17486 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:16:59,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4813 Valid, 17486 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 669 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:16:59,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4902 states. [2025-02-05 17:16:59,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4902 to 4776. [2025-02-05 17:16:59,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4776 states, 4542 states have (on average 1.6893439013650375) internal successors, (7673), 4564 states have internal predecessors, (7673), 158 states have call successors, (158), 54 states have call predecessors, (158), 74 states have return successors, (222), 165 states have call predecessors, (222), 158 states have call successors, (222) [2025-02-05 17:16:59,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4776 states to 4776 states and 8053 transitions. [2025-02-05 17:16:59,334 INFO L78 Accepts]: Start accepts. Automaton has 4776 states and 8053 transitions. Word has length 134 [2025-02-05 17:16:59,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:16:59,334 INFO L471 AbstractCegarLoop]: Abstraction has 4776 states and 8053 transitions. [2025-02-05 17:16:59,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:16:59,334 INFO L276 IsEmpty]: Start isEmpty. Operand 4776 states and 8053 transitions. [2025-02-05 17:16:59,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:16:59,337 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:16:59,337 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:16:59,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:16:59,337 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:16:59,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:16:59,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1263600037, now seen corresponding path program 1 times [2025-02-05 17:16:59,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:16:59,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428483797] [2025-02-05 17:16:59,338 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:16:59,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:16:59,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:16:59,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:16:59,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:16:59,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:16:59,458 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:16:59,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:16:59,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428483797] [2025-02-05 17:16:59,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428483797] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:16:59,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:16:59,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:16:59,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731562679] [2025-02-05 17:16:59,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:16:59,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:16:59,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:16:59,460 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:16:59,460 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:16:59,460 INFO L87 Difference]: Start difference. First operand 4776 states and 8053 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:00,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:17:00,161 INFO L93 Difference]: Finished difference Result 10291 states and 16832 transitions. [2025-02-05 17:17:00,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:17:00,161 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:17:00,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:17:00,187 INFO L225 Difference]: With dead ends: 10291 [2025-02-05 17:17:00,187 INFO L226 Difference]: Without dead ends: 7652 [2025-02-05 17:17:00,196 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:00,197 INFO L435 NwaCegarLoop]: 4538 mSDtfsCounter, 4766 mSDsluCounter, 13653 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4782 SdHoareTripleChecker+Valid, 18191 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 17:17:00,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4782 Valid, 18191 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 17:17:00,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7652 states. [2025-02-05 17:17:00,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7652 to 7477. [2025-02-05 17:17:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7477 states, 7013 states have (on average 1.6513617567374874) internal successors, (11581), 7081 states have internal predecessors, (11581), 294 states have call successors, (294), 102 states have call predecessors, (294), 168 states have return successors, (550), 309 states have call predecessors, (550), 294 states have call successors, (550) [2025-02-05 17:17:00,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7477 states to 7477 states and 12425 transitions. [2025-02-05 17:17:00,418 INFO L78 Accepts]: Start accepts. Automaton has 7477 states and 12425 transitions. Word has length 134 [2025-02-05 17:17:00,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:17:00,418 INFO L471 AbstractCegarLoop]: Abstraction has 7477 states and 12425 transitions. [2025-02-05 17:17:00,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:00,419 INFO L276 IsEmpty]: Start isEmpty. Operand 7477 states and 12425 transitions. [2025-02-05 17:17:00,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:17:00,422 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:17:00,422 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:17:00,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:17:00,422 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:17:00,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:17:00,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1949558972, now seen corresponding path program 1 times [2025-02-05 17:17:00,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:17:00,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298713283] [2025-02-05 17:17:00,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:17:00,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:17:00,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:17:00,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:17:00,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:17:00,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:17: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:17:00,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:17:00,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298713283] [2025-02-05 17:17:00,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298713283] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:17:00,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:17:00,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:17:00,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168585889] [2025-02-05 17:17:00,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:17:00,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:17:00,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:17:00,521 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:17:00,521 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:17:00,522 INFO L87 Difference]: Start difference. First operand 7477 states and 12425 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:17:01,658 INFO L93 Difference]: Finished difference Result 19162 states and 31698 transitions. [2025-02-05 17:17:01,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:17:01,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:17:01,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:17:01,710 INFO L225 Difference]: With dead ends: 19162 [2025-02-05 17:17:01,711 INFO L226 Difference]: Without dead ends: 13822 [2025-02-05 17:17:01,728 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:01,729 INFO L435 NwaCegarLoop]: 4535 mSDtfsCounter, 4761 mSDsluCounter, 13644 mSDsCounter, 0 mSdLazyCounter, 818 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4777 SdHoareTripleChecker+Valid, 18179 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 818 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 17:17:01,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4777 Valid, 18179 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 818 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 17:17:01,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2025-02-05 17:17:02,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13554. [2025-02-05 17:17:02,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13554 states, 12576 states have (on average 1.6362118320610688) internal successors, (20577), 12790 states have internal predecessors, (20577), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-02-05 17:17:02,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13554 states to 13554 states and 22733 transitions. [2025-02-05 17:17:02,305 INFO L78 Accepts]: Start accepts. Automaton has 13554 states and 22733 transitions. Word has length 134 [2025-02-05 17:17:02,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:17:02,306 INFO L471 AbstractCegarLoop]: Abstraction has 13554 states and 22733 transitions. [2025-02-05 17:17:02,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 13554 states and 22733 transitions. [2025-02-05 17:17:02,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:17:02,313 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:17:02,314 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:17:02,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:17:02,314 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:17:02,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:17:02,315 INFO L85 PathProgramCache]: Analyzing trace with hash 1826116037, now seen corresponding path program 1 times [2025-02-05 17:17:02,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:17:02,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133187309] [2025-02-05 17:17:02,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:17:02,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:17:02,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:17:02,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:17:02,330 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:17:02,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:17:02,491 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:02,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:17:02,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133187309] [2025-02-05 17:17:02,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [133187309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:17:02,491 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:17:02,491 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:17:02,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586059707] [2025-02-05 17:17:02,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:17:02,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:17:02,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:17:02,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:17:02,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:17:02,493 INFO L87 Difference]: Start difference. First operand 13554 states and 22733 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:03,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:17:03,069 INFO L93 Difference]: Finished difference Result 27911 states and 47718 transitions. [2025-02-05 17:17:03,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:17:03,070 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:17:03,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:17:03,137 INFO L225 Difference]: With dead ends: 27911 [2025-02-05 17:17:03,138 INFO L226 Difference]: Without dead ends: 16494 [2025-02-05 17:17:03,172 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:03,173 INFO L435 NwaCegarLoop]: 4286 mSDtfsCounter, 4545 mSDsluCounter, 8458 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4561 SdHoareTripleChecker+Valid, 12744 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:17:03,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4561 Valid, 12744 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:17:03,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16494 states. [2025-02-05 17:17:03,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16494 to 13554. [2025-02-05 17:17:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13554 states, 12576 states have (on average 1.633587786259542) internal successors, (20544), 12790 states have internal predecessors, (20544), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-02-05 17:17:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13554 states to 13554 states and 22700 transitions. [2025-02-05 17:17:03,740 INFO L78 Accepts]: Start accepts. Automaton has 13554 states and 22700 transitions. Word has length 134 [2025-02-05 17:17:03,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:17:03,741 INFO L471 AbstractCegarLoop]: Abstraction has 13554 states and 22700 transitions. [2025-02-05 17:17:03,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:03,741 INFO L276 IsEmpty]: Start isEmpty. Operand 13554 states and 22700 transitions. [2025-02-05 17:17:03,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:17:03,748 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:17:03,748 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:17:03,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:17:03,748 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:17:03,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:17:03,749 INFO L85 PathProgramCache]: Analyzing trace with hash 839533348, now seen corresponding path program 1 times [2025-02-05 17:17:03,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:17:03,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286279080] [2025-02-05 17:17:03,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:17:03,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:17:03,757 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:17:03,761 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:17:03,761 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:17:03,761 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:17:03,836 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:03,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:17:03,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286279080] [2025-02-05 17:17:03,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286279080] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:17:03,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:17:03,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:17:03,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242415914] [2025-02-05 17:17:03,837 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:17:03,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:17:03,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:17:03,838 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:17:03,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:17:03,838 INFO L87 Difference]: Start difference. First operand 13554 states and 22700 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:04,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:17:04,391 INFO L93 Difference]: Finished difference Result 27666 states and 47162 transitions. [2025-02-05 17:17:04,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:17:04,392 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:17:04,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:17:04,447 INFO L225 Difference]: With dead ends: 27666 [2025-02-05 17:17:04,447 INFO L226 Difference]: Without dead ends: 16249 [2025-02-05 17:17:04,476 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:04,477 INFO L435 NwaCegarLoop]: 4283 mSDtfsCounter, 4542 mSDsluCounter, 8453 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4558 SdHoareTripleChecker+Valid, 12736 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:17:04,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4558 Valid, 12736 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:17:04,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16249 states. [2025-02-05 17:17:05,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16249 to 13554. [2025-02-05 17:17:05,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13554 states, 12576 states have (on average 1.6309637404580153) internal successors, (20511), 12790 states have internal predecessors, (20511), 566 states have call successors, (566), 198 states have call predecessors, (566), 410 states have return successors, (1590), 597 states have call predecessors, (1590), 566 states have call successors, (1590) [2025-02-05 17:17:05,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13554 states to 13554 states and 22667 transitions. [2025-02-05 17:17:05,120 INFO L78 Accepts]: Start accepts. Automaton has 13554 states and 22667 transitions. Word has length 134 [2025-02-05 17:17:05,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:17:05,120 INFO L471 AbstractCegarLoop]: Abstraction has 13554 states and 22667 transitions. [2025-02-05 17:17:05,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:05,120 INFO L276 IsEmpty]: Start isEmpty. Operand 13554 states and 22667 transitions. [2025-02-05 17:17:05,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:17:05,128 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:17:05,128 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:17:05,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 17:17:05,128 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:17:05,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:17:05,129 INFO L85 PathProgramCache]: Analyzing trace with hash 1916086757, now seen corresponding path program 1 times [2025-02-05 17:17:05,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:17:05,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900431934] [2025-02-05 17:17:05,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:17:05,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:17:05,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:17:05,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:17:05,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:17:05,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:17:05,256 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:05,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:17:05,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900431934] [2025-02-05 17:17:05,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1900431934] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:17:05,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:17:05,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:17:05,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722056306] [2025-02-05 17:17:05,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:17:05,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:17:05,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:17:05,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:17:05,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:17:05,258 INFO L87 Difference]: Start difference. First operand 13554 states and 22667 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:06,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:17:06,707 INFO L93 Difference]: Finished difference Result 40825 states and 69395 transitions. [2025-02-05 17:17:06,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:17:06,708 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:17:06,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:17:06,844 INFO L225 Difference]: With dead ends: 40825 [2025-02-05 17:17:06,844 INFO L226 Difference]: Without dead ends: 29408 [2025-02-05 17:17:06,889 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:17:06,889 INFO L435 NwaCegarLoop]: 4520 mSDtfsCounter, 4994 mSDsluCounter, 13596 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5019 SdHoareTripleChecker+Valid, 18116 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:17:06,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5019 Valid, 18116 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:17:06,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29408 states. [2025-02-05 17:17:07,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29408 to 26989. [2025-02-05 17:17:07,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26989 states, 24853 states have (on average 1.634691988894701) internal successors, (40627), 25521 states have internal predecessors, (40627), 1078 states have call successors, (1078), 390 states have call predecessors, (1078), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-02-05 17:17:07,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26989 states to 26989 states and 46879 transitions. [2025-02-05 17:17:07,925 INFO L78 Accepts]: Start accepts. Automaton has 26989 states and 46879 transitions. Word has length 134 [2025-02-05 17:17:07,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:17:07,926 INFO L471 AbstractCegarLoop]: Abstraction has 26989 states and 46879 transitions. [2025-02-05 17:17:07,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:07,926 INFO L276 IsEmpty]: Start isEmpty. Operand 26989 states and 46879 transitions. [2025-02-05 17:17:07,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:17:07,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:17:07,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:17:07,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 17:17:07,939 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:17:07,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:17:07,940 INFO L85 PathProgramCache]: Analyzing trace with hash -543037692, now seen corresponding path program 1 times [2025-02-05 17:17:07,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:17:07,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072879921] [2025-02-05 17:17:07,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:17:07,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:17:07,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:17:07,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:17:07,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:17:07,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:17:08,053 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:08,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:17:08,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072879921] [2025-02-05 17:17:08,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072879921] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:17:08,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:17:08,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:17:08,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617409940] [2025-02-05 17:17:08,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:17:08,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:17:08,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:17:08,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:17:08,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:17:08,056 INFO L87 Difference]: Start difference. First operand 26989 states and 46879 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:09,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:17:09,450 INFO L93 Difference]: Finished difference Result 58420 states and 104966 transitions. [2025-02-05 17:17:09,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:17:09,451 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:17:09,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:17:09,599 INFO L225 Difference]: With dead ends: 58420 [2025-02-05 17:17:09,599 INFO L226 Difference]: Without dead ends: 33568 [2025-02-05 17:17:09,681 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:09,683 INFO L435 NwaCegarLoop]: 4278 mSDtfsCounter, 4536 mSDsluCounter, 8442 mSDsCounter, 0 mSdLazyCounter, 334 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4552 SdHoareTripleChecker+Valid, 12720 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:17:09,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4552 Valid, 12720 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 334 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:17:09,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33568 states. [2025-02-05 17:17:11,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33568 to 26989. [2025-02-05 17:17:11,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26989 states, 24853 states have (on average 1.632076610469561) internal successors, (40562), 25521 states have internal predecessors, (40562), 1078 states have call successors, (1078), 390 states have call predecessors, (1078), 1056 states have return successors, (5174), 1141 states have call predecessors, (5174), 1078 states have call successors, (5174) [2025-02-05 17:17:11,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26989 states to 26989 states and 46814 transitions. [2025-02-05 17:17:11,704 INFO L78 Accepts]: Start accepts. Automaton has 26989 states and 46814 transitions. Word has length 134 [2025-02-05 17:17:11,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:17:11,705 INFO L471 AbstractCegarLoop]: Abstraction has 26989 states and 46814 transitions. [2025-02-05 17:17:11,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:11,705 INFO L276 IsEmpty]: Start isEmpty. Operand 26989 states and 46814 transitions. [2025-02-05 17:17:11,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:17:11,716 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:17:11,716 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:17:11,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 17:17:11,717 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:17:11,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:17:11,717 INFO L85 PathProgramCache]: Analyzing trace with hash -483816955, now seen corresponding path program 1 times [2025-02-05 17:17:11,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:17:11,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056914757] [2025-02-05 17:17:11,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:17:11,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:17:11,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:17:11,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:17:11,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:17:11,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:17:11,982 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:11,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:17:11,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056914757] [2025-02-05 17:17:11,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056914757] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:17:11,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:17:11,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:17:11,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16958420] [2025-02-05 17:17:11,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:17:11,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:17:11,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:17:11,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:17:11,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:17:11,984 INFO L87 Difference]: Start difference. First operand 26989 states and 46814 transitions. Second operand has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:14,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:17:14,125 INFO L93 Difference]: Finished difference Result 85774 states and 155330 transitions. [2025-02-05 17:17:14,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:17:14,126 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:17:14,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:17:14,464 INFO L225 Difference]: With dead ends: 85774 [2025-02-05 17:17:14,464 INFO L226 Difference]: Without dead ends: 60922 [2025-02-05 17:17:14,512 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:17:14,513 INFO L435 NwaCegarLoop]: 4512 mSDtfsCounter, 4921 mSDsluCounter, 13573 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4946 SdHoareTripleChecker+Valid, 18085 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 17:17:14,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4946 Valid, 18085 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 821 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 17:17:14,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60922 states. [2025-02-05 17:17:17,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60922 to 57165. [2025-02-05 17:17:17,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57165 states, 52259 states have (on average 1.6452668439885954) internal successors, (85980), 54321 states have internal predecessors, (85980), 2070 states have call successors, (2070), 774 states have call predecessors, (2070), 2834 states have return successors, (18454), 2197 states have call predecessors, (18454), 2070 states have call successors, (18454) [2025-02-05 17:17:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57165 states to 57165 states and 106504 transitions. [2025-02-05 17:17:18,331 INFO L78 Accepts]: Start accepts. Automaton has 57165 states and 106504 transitions. Word has length 134 [2025-02-05 17:17:18,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:17:18,332 INFO L471 AbstractCegarLoop]: Abstraction has 57165 states and 106504 transitions. [2025-02-05 17:17:18,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 20.666666666666668) internal successors, (124), 5 states have internal predecessors, (124), 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:18,332 INFO L276 IsEmpty]: Start isEmpty. Operand 57165 states and 106504 transitions. [2025-02-05 17:17:18,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-02-05 17:17:18,351 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:17:18,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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 17:17:18,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 17:17:18,352 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:17:18,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:17:18,352 INFO L85 PathProgramCache]: Analyzing trace with hash 210830052, now seen corresponding path program 1 times [2025-02-05 17:17:18,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:17:18,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034175744] [2025-02-05 17:17:18,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:17:18,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:17:18,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-02-05 17:17:18,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-02-05 17:17:18,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:17:18,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:17:18,559 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:18,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:17:18,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034175744] [2025-02-05 17:17:18,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034175744] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:17:18,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:17:18,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:17:18,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444629446] [2025-02-05 17:17:18,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:17:18,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:17:18,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:17:18,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:17:18,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:17:18,561 INFO L87 Difference]: Start difference. First operand 57165 states and 106504 transitions. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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:21,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:17:21,947 INFO L93 Difference]: Finished difference Result 127516 states and 249746 transitions. [2025-02-05 17:17:21,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:17:21,948 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 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 134 [2025-02-05 17:17:21,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:17:22,273 INFO L225 Difference]: With dead ends: 127516 [2025-02-05 17:17:22,273 INFO L226 Difference]: Without dead ends: 72488 [2025-02-05 17:17:22,411 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:22,412 INFO L435 NwaCegarLoop]: 4260 mSDtfsCounter, 4543 mSDsluCounter, 8420 mSDsCounter, 0 mSdLazyCounter, 332 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4559 SdHoareTripleChecker+Valid, 12680 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:17:22,412 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4559 Valid, 12680 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 332 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:17:22,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72488 states.