./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.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_label45+token_ring.03.cil-2.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 198234a6cbed333832b896acc347872fc09d4c349ed801953a7aa6331aa2ab3f --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 17:12:36,715 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 17:12:36,782 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:12:36,791 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 17:12:36,791 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 17:12:36,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 17:12:36,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 17:12:36,809 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 17:12:36,810 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 17:12:36,810 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 17:12:36,810 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 17:12:36,810 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 17:12:36,811 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 17:12:36,811 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 17:12:36,811 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 17:12:36,811 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 17:12:36,811 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 17:12:36,811 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 17:12:36,812 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 17:12:36,812 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 17:12:36,812 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 17:12:36,812 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 17:12:36,812 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 17:12:36,812 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 17:12:36,812 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 17:12:36,812 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 17:12:36,812 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 17:12:36,812 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 17:12:36,812 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 17:12:36,812 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 17:12:36,813 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 17:12:36,813 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 17:12:36,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:12:36,813 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 17:12:36,813 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 17:12:36,813 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 17:12:36,813 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 17:12:36,813 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 17:12:36,813 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 17:12:36,813 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 17:12:36,813 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 17:12:36,813 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 17:12:36,814 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 17:12:36,814 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 -> 198234a6cbed333832b896acc347872fc09d4c349ed801953a7aa6331aa2ab3f [2025-02-05 17:12:37,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 17:12:37,118 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 17:12:37,120 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 17:12:37,121 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 17:12:37,121 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 17:12:37,124 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.c [2025-02-05 17:12:38,539 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1374ff8ec/175bdc1d1ac54a539cf322e84fe9bc4a/FLAGd87f6d414 [2025-02-05 17:12:39,375 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 17:12:39,376 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-2.c [2025-02-05 17:12:39,429 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1374ff8ec/175bdc1d1ac54a539cf322e84fe9bc4a/FLAGd87f6d414 [2025-02-05 17:12:39,450 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1374ff8ec/175bdc1d1ac54a539cf322e84fe9bc4a [2025-02-05 17:12:39,453 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 17:12:39,455 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 17:12:39,456 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 17:12:39,456 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 17:12:39,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 17:12:39,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:12:39" (1/1) ... [2025-02-05 17:12:39,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24bc88bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:39, skipping insertion in model container [2025-02-05 17:12:39,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 05:12:39" (1/1) ... [2025-02-05 17:12:39,632 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 17:12:41,007 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_label45+token_ring.03.cil-2.c[380323,380336] [2025-02-05 17:12:41,043 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_label45+token_ring.03.cil-2.c[383339,383352] [2025-02-05 17:12:41,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:12:41,262 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 17:12:41,915 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_label45+token_ring.03.cil-2.c[380323,380336] [2025-02-05 17:12:41,921 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_label45+token_ring.03.cil-2.c[383339,383352] [2025-02-05 17:12:41,938 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 17:12:41,999 INFO L204 MainTranslator]: Completed translation [2025-02-05 17:12:42,000 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:41 WrapperNode [2025-02-05 17:12:42,001 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 17:12:42,002 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 17:12:42,002 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 17:12:42,003 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 17:12:42,008 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:12:41" (1/1) ... [2025-02-05 17:12:42,086 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:12:41" (1/1) ... [2025-02-05 17:12:42,402 INFO L138 Inliner]: procedures = 50, calls = 50, calls flagged for inlining = 28, calls inlined = 28, statements flattened = 12672 [2025-02-05 17:12:42,404 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 17:12:42,405 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 17:12:42,406 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 17:12:42,406 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 17:12:42,415 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:41" (1/1) ... [2025-02-05 17:12:42,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:41" (1/1) ... [2025-02-05 17:12:42,476 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:41" (1/1) ... [2025-02-05 17:12:42,647 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:12:42,647 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:41" (1/1) ... [2025-02-05 17:12:42,648 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:41" (1/1) ... [2025-02-05 17:12:42,793 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:41" (1/1) ... [2025-02-05 17:12:42,819 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:41" (1/1) ... [2025-02-05 17:12:42,845 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:41" (1/1) ... [2025-02-05 17:12:42,869 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:41" (1/1) ... [2025-02-05 17:12:42,939 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 17:12:42,940 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 17:12:42,940 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 17:12:42,940 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 17:12:42,941 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:41" (1/1) ... [2025-02-05 17:12:42,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 17:12:42,959 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:12:42,976 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:12:42,980 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:12:43,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 17:12:43,005 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-02-05 17:12:43,005 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-02-05 17:12:43,005 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-02-05 17:12:43,005 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-02-05 17:12:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-02-05 17:12:43,006 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-02-05 17:12:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-02-05 17:12:43,006 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-02-05 17:12:43,006 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-02-05 17:12:43,006 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-02-05 17:12:43,007 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-02-05 17:12:43,007 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-02-05 17:12:43,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 17:12:43,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 17:12:43,007 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 17:12:43,121 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 17:12:43,122 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 17:12:50,847 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-02-05 17:12:50,847 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-02-05 17:12:50,848 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-02-05 17:12:50,848 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-02-05 17:12:50,849 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-02-05 17:12:50,849 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-02-05 17:12:50,849 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-02-05 17:12:51,079 INFO L? ?]: Removed 1701 outVars from TransFormulas that were not future-live. [2025-02-05 17:12:51,079 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 17:12:51,151 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 17:12:51,155 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 17:12:51,155 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:12:51 BoogieIcfgContainer [2025-02-05 17:12:51,155 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 17:12:51,158 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 17:12:51,160 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 17:12:51,164 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 17:12:51,164 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 05:12:39" (1/3) ... [2025-02-05 17:12:51,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5137c98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:12:51, skipping insertion in model container [2025-02-05 17:12:51,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 05:12:41" (2/3) ... [2025-02-05 17:12:51,165 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5137c98d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 05:12:51, skipping insertion in model container [2025-02-05 17:12:51,165 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 05:12:51" (3/3) ... [2025-02-05 17:12:51,168 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.03.cil-2.c [2025-02-05 17:12:51,184 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 17:12:51,188 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label45+token_ring.03.cil-2.c that has 7 procedures, 2348 locations, 1 initial locations, 7 loop locations, and 2 error locations. [2025-02-05 17:12:51,320 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 17:12:51,334 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;@5f2e962b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 17:12:51,334 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-02-05 17:12:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand has 2348 states, 2322 states have (on average 1.8496985357450473) internal successors, (4295), 2325 states have internal predecessors, (4295), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-02-05 17:12:51,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:12:51,359 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:51,359 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] [2025-02-05 17:12:51,360 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:51,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:51,366 INFO L85 PathProgramCache]: Analyzing trace with hash -487538790, now seen corresponding path program 1 times [2025-02-05 17:12:51,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:51,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506851545] [2025-02-05 17:12:51,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:51,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:51,458 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:12:51,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:12:51,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:51,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:51,888 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:12:51,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:51,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506851545] [2025-02-05 17:12:51,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506851545] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:51,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:51,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:12:51,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539499286] [2025-02-05 17:12:51,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:51,897 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:12:51,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:51,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:12:51,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:12:51,929 INFO L87 Difference]: Start difference. First operand has 2348 states, 2322 states have (on average 1.8496985357450473) internal successors, (4295), 2325 states have internal predecessors, (4295), 17 states have call successors, (17), 6 states have call predecessors, (17), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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:12:52,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:52,586 INFO L93 Difference]: Finished difference Result 4849 states and 8893 transitions. [2025-02-05 17:12:52,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 17:12:52,589 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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 79 [2025-02-05 17:12:52,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:52,618 INFO L225 Difference]: With dead ends: 4849 [2025-02-05 17:12:52,618 INFO L226 Difference]: Without dead ends: 2442 [2025-02-05 17:12:52,631 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:12:52,635 INFO L435 NwaCegarLoop]: 4210 mSDtfsCounter, 4419 mSDsluCounter, 8509 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4430 SdHoareTripleChecker+Valid, 12719 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:52,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4430 Valid, 12719 Invalid, 301 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [38 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 17:12:52,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2442 states. [2025-02-05 17:12:52,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2442 to 2431. [2025-02-05 17:12:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2431 states, 2387 states have (on average 1.8236279849183075) internal successors, (4353), 2390 states have internal predecessors, (4353), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-02-05 17:12:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 4412 transitions. [2025-02-05 17:12:52,786 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 4412 transitions. Word has length 79 [2025-02-05 17:12:52,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:52,787 INFO L471 AbstractCegarLoop]: Abstraction has 2431 states and 4412 transitions. [2025-02-05 17:12:52,787 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 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:12:52,787 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 4412 transitions. [2025-02-05 17:12:52,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:12:52,792 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:52,793 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] [2025-02-05 17:12:52,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 17:12:52,794 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:52,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:52,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1778468956, now seen corresponding path program 1 times [2025-02-05 17:12:52,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:52,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74164997] [2025-02-05 17:12:52,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:52,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:52,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:12:52,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:12:52,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:52,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:53,017 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:12:53,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:53,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74164997] [2025-02-05 17:12:53,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74164997] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:53,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:53,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:12:53,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310663930] [2025-02-05 17:12:53,019 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:53,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:12:53,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:53,022 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:12:53,023 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:12:53,023 INFO L87 Difference]: Start difference. First operand 2431 states and 4412 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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:12:53,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:53,279 INFO L93 Difference]: Finished difference Result 2754 states and 4895 transitions. [2025-02-05 17:12:53,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:12:53,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-02-05 17:12:53,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:53,293 INFO L225 Difference]: With dead ends: 2754 [2025-02-05 17:12:53,294 INFO L226 Difference]: Without dead ends: 2455 [2025-02-05 17:12:53,297 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:12:53,298 INFO L435 NwaCegarLoop]: 4129 mSDtfsCounter, 4248 mSDsluCounter, 8193 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4259 SdHoareTripleChecker+Valid, 12322 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:53,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4259 Valid, 12322 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:12:53,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2455 states. [2025-02-05 17:12:53,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2455 to 2431. [2025-02-05 17:12:53,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2431 states, 2387 states have (on average 1.8227901131126938) internal successors, (4351), 2390 states have internal predecessors, (4351), 29 states have call successors, (29), 12 states have call predecessors, (29), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-02-05 17:12:53,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2431 states to 2431 states and 4410 transitions. [2025-02-05 17:12:53,387 INFO L78 Accepts]: Start accepts. Automaton has 2431 states and 4410 transitions. Word has length 79 [2025-02-05 17:12:53,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:53,388 INFO L471 AbstractCegarLoop]: Abstraction has 2431 states and 4410 transitions. [2025-02-05 17:12:53,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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:12:53,388 INFO L276 IsEmpty]: Start isEmpty. Operand 2431 states and 4410 transitions. [2025-02-05 17:12:53,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:12:53,393 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:53,393 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] [2025-02-05 17:12:53,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 17:12:53,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:53,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:53,394 INFO L85 PathProgramCache]: Analyzing trace with hash -396211141, now seen corresponding path program 1 times [2025-02-05 17:12:53,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:53,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220853527] [2025-02-05 17:12:53,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:53,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:53,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:12:53,415 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:12:53,415 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:53,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:53,564 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:12:53,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:53,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220853527] [2025-02-05 17:12:53,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220853527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:53,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:53,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:12:53,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731344698] [2025-02-05 17:12:53,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:53,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:12:53,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:53,566 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:12:53,566 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:53,566 INFO L87 Difference]: Start difference. First operand 2431 states and 4410 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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:12:54,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:54,090 INFO L93 Difference]: Finished difference Result 2904 states and 5103 transitions. [2025-02-05 17:12:54,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:12:54,092 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-02-05 17:12:54,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:54,107 INFO L225 Difference]: With dead ends: 2904 [2025-02-05 17:12:54,107 INFO L226 Difference]: Without dead ends: 2605 [2025-02-05 17:12:54,110 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:12:54,110 INFO L435 NwaCegarLoop]: 4249 mSDtfsCounter, 4333 mSDsluCounter, 12733 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4344 SdHoareTripleChecker+Valid, 16982 SdHoareTripleChecker+Invalid, 511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:54,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4344 Valid, 16982 Invalid, 511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:12:54,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2025-02-05 17:12:54,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 2570. [2025-02-05 17:12:54,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2570 states, 2507 states have (on average 1.8041483845233346) internal successors, (4523), 2511 states have internal predecessors, (4523), 41 states have call successors, (41), 18 states have call predecessors, (41), 20 states have return successors, (45), 42 states have call predecessors, (45), 41 states have call successors, (45) [2025-02-05 17:12:54,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2570 states to 2570 states and 4609 transitions. [2025-02-05 17:12:54,196 INFO L78 Accepts]: Start accepts. Automaton has 2570 states and 4609 transitions. Word has length 79 [2025-02-05 17:12:54,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:54,196 INFO L471 AbstractCegarLoop]: Abstraction has 2570 states and 4609 transitions. [2025-02-05 17:12:54,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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:12:54,196 INFO L276 IsEmpty]: Start isEmpty. Operand 2570 states and 4609 transitions. [2025-02-05 17:12:54,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:12:54,198 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:54,198 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] [2025-02-05 17:12:54,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 17:12:54,198 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:54,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:54,199 INFO L85 PathProgramCache]: Analyzing trace with hash 2090908634, now seen corresponding path program 1 times [2025-02-05 17:12:54,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:54,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692796756] [2025-02-05 17:12:54,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:54,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:54,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:12:54,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:12:54,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:54,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:54,342 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:12:54,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:54,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692796756] [2025-02-05 17:12:54,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692796756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:54,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:54,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:12:54,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832953140] [2025-02-05 17:12:54,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:54,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:12:54,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:54,344 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:12:54,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:54,344 INFO L87 Difference]: Start difference. First operand 2570 states and 4609 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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:12:54,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:54,871 INFO L93 Difference]: Finished difference Result 3383 states and 5796 transitions. [2025-02-05 17:12:54,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:12:54,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-02-05 17:12:54,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:54,888 INFO L225 Difference]: With dead ends: 3383 [2025-02-05 17:12:54,889 INFO L226 Difference]: Without dead ends: 2945 [2025-02-05 17:12:54,892 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:12:54,895 INFO L435 NwaCegarLoop]: 4243 mSDtfsCounter, 4432 mSDsluCounter, 12710 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4447 SdHoareTripleChecker+Valid, 16953 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:54,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4447 Valid, 16953 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:12:54,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states. [2025-02-05 17:12:54,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2851. [2025-02-05 17:12:54,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2750 states have (on average 1.7723636363636364) internal successors, (4874), 2758 states have internal predecessors, (4874), 63 states have call successors, (63), 30 states have call predecessors, (63), 36 states have return successors, (79), 66 states have call predecessors, (79), 63 states have call successors, (79) [2025-02-05 17:12:54,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 5016 transitions. [2025-02-05 17:12:54,996 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 5016 transitions. Word has length 79 [2025-02-05 17:12:54,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:54,997 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 5016 transitions. [2025-02-05 17:12:54,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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:12:54,997 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 5016 transitions. [2025-02-05 17:12:54,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:12:54,999 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:54,999 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] [2025-02-05 17:12:55,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 17:12:55,000 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:55,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:55,000 INFO L85 PathProgramCache]: Analyzing trace with hash 924212315, now seen corresponding path program 1 times [2025-02-05 17:12:55,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:55,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558433401] [2025-02-05 17:12:55,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:55,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:55,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:12:55,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:12:55,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:55,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:55,122 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:12:55,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:55,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558433401] [2025-02-05 17:12:55,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558433401] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:55,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:55,125 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:12:55,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497033358] [2025-02-05 17:12:55,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:55,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:12:55,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:55,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:12:55,126 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:12:55,127 INFO L87 Difference]: Start difference. First operand 2851 states and 5016 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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:12:55,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:55,582 INFO L93 Difference]: Finished difference Result 3614 states and 6140 transitions. [2025-02-05 17:12:55,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:12:55,583 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-02-05 17:12:55,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:55,602 INFO L225 Difference]: With dead ends: 3614 [2025-02-05 17:12:55,602 INFO L226 Difference]: Without dead ends: 2895 [2025-02-05 17:12:55,606 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:12:55,607 INFO L435 NwaCegarLoop]: 4120 mSDtfsCounter, 4240 mSDsluCounter, 8174 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4251 SdHoareTripleChecker+Valid, 12294 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:55,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4251 Valid, 12294 Invalid, 220 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [26 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:12:55,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2895 states. [2025-02-05 17:12:55,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2895 to 2851. [2025-02-05 17:12:55,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2851 states, 2750 states have (on average 1.7705454545454546) internal successors, (4869), 2758 states have internal predecessors, (4869), 63 states have call successors, (63), 30 states have call predecessors, (63), 36 states have return successors, (79), 66 states have call predecessors, (79), 63 states have call successors, (79) [2025-02-05 17:12:55,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2851 states to 2851 states and 5011 transitions. [2025-02-05 17:12:55,781 INFO L78 Accepts]: Start accepts. Automaton has 2851 states and 5011 transitions. Word has length 79 [2025-02-05 17:12:55,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:55,782 INFO L471 AbstractCegarLoop]: Abstraction has 2851 states and 5011 transitions. [2025-02-05 17:12:55,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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:12:55,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2851 states and 5011 transitions. [2025-02-05 17:12:55,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:12:55,785 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:55,785 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] [2025-02-05 17:12:55,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 17:12:55,790 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:55,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:55,790 INFO L85 PathProgramCache]: Analyzing trace with hash 1025124282, now seen corresponding path program 1 times [2025-02-05 17:12:55,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:55,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145225992] [2025-02-05 17:12:55,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:55,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:55,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:12:55,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:12:55,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:55,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:55,965 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:12:55,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:55,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145225992] [2025-02-05 17:12:55,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145225992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:55,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:55,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 17:12:55,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490802289] [2025-02-05 17:12:55,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:55,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 17:12:55,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:55,969 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 17:12:55,969 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:55,970 INFO L87 Difference]: Start difference. First operand 2851 states and 5011 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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:12:56,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:56,506 INFO L93 Difference]: Finished difference Result 4230 states and 7016 transitions. [2025-02-05 17:12:56,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 17:12:56,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-02-05 17:12:56,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:56,523 INFO L225 Difference]: With dead ends: 4230 [2025-02-05 17:12:56,524 INFO L226 Difference]: Without dead ends: 3511 [2025-02-05 17:12:56,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-02-05 17:12:56,529 INFO L435 NwaCegarLoop]: 4235 mSDtfsCounter, 4359 mSDsluCounter, 12687 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4374 SdHoareTripleChecker+Valid, 16922 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:56,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4374 Valid, 16922 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 17:12:56,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3511 states. [2025-02-05 17:12:56,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3511 to 3419. [2025-02-05 17:12:56,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 3238 states have (on average 1.7192711550339717) internal successors, (5567), 3260 states have internal predecessors, (5567), 105 states have call successors, (105), 54 states have call predecessors, (105), 74 states have return successors, (169), 112 states have call predecessors, (169), 105 states have call successors, (169) [2025-02-05 17:12:56,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5841 transitions. [2025-02-05 17:12:56,667 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5841 transitions. Word has length 79 [2025-02-05 17:12:56,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:56,668 INFO L471 AbstractCegarLoop]: Abstraction has 3419 states and 5841 transitions. [2025-02-05 17:12:56,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 5 states have internal predecessors, (69), 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:12:56,669 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5841 transitions. [2025-02-05 17:12:56,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:12:56,674 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:56,675 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] [2025-02-05 17:12:56,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 17:12:56,675 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:56,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:56,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1305474171, now seen corresponding path program 1 times [2025-02-05 17:12:56,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:56,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403443569] [2025-02-05 17:12:56,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:56,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:56,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:12:56,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:12:56,695 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:56,695 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:56,768 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:12:56,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:56,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403443569] [2025-02-05 17:12:56,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403443569] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:56,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:56,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 17:12:56,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117072891] [2025-02-05 17:12:56,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:56,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 17:12:56,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:56,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 17:12:56,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 17:12:56,771 INFO L87 Difference]: Start difference. First operand 3419 states and 5841 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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:12:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:57,038 INFO L93 Difference]: Finished difference Result 4764 states and 7820 transitions. [2025-02-05 17:12:57,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:12:57,039 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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 79 [2025-02-05 17:12:57,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:57,058 INFO L225 Difference]: With dead ends: 4764 [2025-02-05 17:12:57,059 INFO L226 Difference]: Without dead ends: 3477 [2025-02-05 17:12:57,065 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:12:57,065 INFO L435 NwaCegarLoop]: 4115 mSDtfsCounter, 4236 mSDsluCounter, 8165 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4247 SdHoareTripleChecker+Valid, 12280 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:57,066 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4247 Valid, 12280 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 17:12:57,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3477 states. [2025-02-05 17:12:57,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3477 to 3419. [2025-02-05 17:12:57,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3419 states, 3238 states have (on average 1.7164916615194565) internal successors, (5558), 3260 states have internal predecessors, (5558), 105 states have call successors, (105), 54 states have call predecessors, (105), 74 states have return successors, (169), 112 states have call predecessors, (169), 105 states have call successors, (169) [2025-02-05 17:12:57,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3419 states to 3419 states and 5832 transitions. [2025-02-05 17:12:57,297 INFO L78 Accepts]: Start accepts. Automaton has 3419 states and 5832 transitions. Word has length 79 [2025-02-05 17:12:57,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:57,298 INFO L471 AbstractCegarLoop]: Abstraction has 3419 states and 5832 transitions. [2025-02-05 17:12:57,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 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:12:57,300 INFO L276 IsEmpty]: Start isEmpty. Operand 3419 states and 5832 transitions. [2025-02-05 17:12:57,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 17:12:57,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:57,303 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] [2025-02-05 17:12:57,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 17:12:57,303 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:57,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:57,304 INFO L85 PathProgramCache]: Analyzing trace with hash -625144934, now seen corresponding path program 1 times [2025-02-05 17:12:57,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:57,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [99551695] [2025-02-05 17:12:57,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:57,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:57,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 17:12:57,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 17:12:57,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:57,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:57,372 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:12:57,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:57,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [99551695] [2025-02-05 17:12:57,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [99551695] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:57,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 17:12:57,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 17:12:57,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [61607989] [2025-02-05 17:12:57,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:57,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 17:12:57,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:57,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 17:12:57,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:12:57,374 INFO L87 Difference]: Start difference. First operand 3419 states and 5832 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:12:57,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:57,615 INFO L93 Difference]: Finished difference Result 5943 states and 9555 transitions. [2025-02-05 17:12:57,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 17:12:57,616 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 79 [2025-02-05 17:12:57,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:57,652 INFO L225 Difference]: With dead ends: 5943 [2025-02-05 17:12:57,652 INFO L226 Difference]: Without dead ends: 4657 [2025-02-05 17:12:57,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 17:12:57,660 INFO L435 NwaCegarLoop]: 4380 mSDtfsCounter, 4347 mSDsluCounter, 4317 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4347 SdHoareTripleChecker+Valid, 8697 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:57,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4347 Valid, 8697 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 17:12:57,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4657 states. [2025-02-05 17:12:57,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4657 to 4648. [2025-02-05 17:12:57,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4648 states, 4292 states have (on average 1.635135135135135) internal successors, (7018), 4343 states have internal predecessors, (7018), 206 states have call successors, (206), 108 states have call predecessors, (206), 148 states have return successors, (327), 204 states have call predecessors, (327), 206 states have call successors, (327) [2025-02-05 17:12:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4648 states to 4648 states and 7551 transitions. [2025-02-05 17:12:57,862 INFO L78 Accepts]: Start accepts. Automaton has 4648 states and 7551 transitions. Word has length 79 [2025-02-05 17:12:57,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:57,863 INFO L471 AbstractCegarLoop]: Abstraction has 4648 states and 7551 transitions. [2025-02-05 17:12:57,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-05 17:12:57,863 INFO L276 IsEmpty]: Start isEmpty. Operand 4648 states and 7551 transitions. [2025-02-05 17:12:57,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 17:12:57,871 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:57,872 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:57,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 17:12:57,872 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:57,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:57,873 INFO L85 PathProgramCache]: Analyzing trace with hash -1353994054, now seen corresponding path program 1 times [2025-02-05 17:12:57,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:57,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426856453] [2025-02-05 17:12:57,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:57,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:57,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 17:12:57,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 17:12:57,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:57,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:57,964 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:12:57,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:57,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426856453] [2025-02-05 17:12:57,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426856453] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:12:57,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [581995009] [2025-02-05 17:12:57,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:57,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:12:57,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:12:57,969 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:12:57,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 17:12:58,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 17:12:58,085 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 17:12:58,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:58,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:58,090 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:12:58,096 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:12:58,163 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 17:12:58,165 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:12:58,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [581995009] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:58,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:12:58,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:12:58,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787599926] [2025-02-05 17:12:58,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:58,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:12:58,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:58,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:12:58,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:58,167 INFO L87 Difference]: Start difference. First operand 4648 states and 7551 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:12:58,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:58,544 INFO L93 Difference]: Finished difference Result 9587 states and 14641 transitions. [2025-02-05 17:12:58,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:12:58,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 130 [2025-02-05 17:12:58,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:12:58,585 INFO L225 Difference]: With dead ends: 9587 [2025-02-05 17:12:58,585 INFO L226 Difference]: Without dead ends: 7072 [2025-02-05 17:12:58,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:58,598 INFO L435 NwaCegarLoop]: 4184 mSDtfsCounter, 4140 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4140 SdHoareTripleChecker+Valid, 4386 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:12:58,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4140 Valid, 4386 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:12:58,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7072 states. [2025-02-05 17:12:58,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7072 to 7016. [2025-02-05 17:12:59,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7016 states, 6328 states have (on average 1.5619469026548674) internal successors, (9884), 6428 states have internal predecessors, (9884), 390 states have call successors, (390), 216 states have call predecessors, (390), 296 states have return successors, (625), 379 states have call predecessors, (625), 390 states have call successors, (625) [2025-02-05 17:12:59,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7016 states to 7016 states and 10899 transitions. [2025-02-05 17:12:59,029 INFO L78 Accepts]: Start accepts. Automaton has 7016 states and 10899 transitions. Word has length 130 [2025-02-05 17:12:59,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:12:59,029 INFO L471 AbstractCegarLoop]: Abstraction has 7016 states and 10899 transitions. [2025-02-05 17:12:59,029 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 2 states have internal predecessors, (94), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:12:59,030 INFO L276 IsEmpty]: Start isEmpty. Operand 7016 states and 10899 transitions. [2025-02-05 17:12:59,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 17:12:59,042 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:12:59,042 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:12:59,051 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 17:12:59,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:12:59,244 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:12:59,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:12:59,244 INFO L85 PathProgramCache]: Analyzing trace with hash -928323724, now seen corresponding path program 1 times [2025-02-05 17:12:59,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:12:59,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155610747] [2025-02-05 17:12:59,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:59,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:12:59,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 17:12:59,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 17:12:59,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:59,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:59,344 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:12:59,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:12:59,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155610747] [2025-02-05 17:12:59,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155610747] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:12:59,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029411003] [2025-02-05 17:12:59,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:12:59,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:12:59,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:12:59,348 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:12:59,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 17:12:59,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 17:12:59,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 17:12:59,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:12:59,466 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:12:59,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:12:59,473 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:12:59,549 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-02-05 17:12:59,551 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:12:59,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029411003] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:12:59,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:12:59,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:12:59,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042574988] [2025-02-05 17:12:59,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:12:59,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:12:59,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:12:59,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:12:59,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:12:59,553 INFO L87 Difference]: Start difference. First operand 7016 states and 10899 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:12:59,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:12:59,977 INFO L93 Difference]: Finished difference Result 16649 states and 24697 transitions. [2025-02-05 17:12:59,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:12:59,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 130 [2025-02-05 17:12:59,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:00,026 INFO L225 Difference]: With dead ends: 16649 [2025-02-05 17:13:00,027 INFO L226 Difference]: Without dead ends: 11766 [2025-02-05 17:13:00,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:00,046 INFO L435 NwaCegarLoop]: 4184 mSDtfsCounter, 4134 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4134 SdHoareTripleChecker+Valid, 4386 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:00,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4134 Valid, 4386 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:13:00,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11766 states. [2025-02-05 17:13:00,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11766 to 11656. [2025-02-05 17:13:00,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11656 states, 10306 states have (on average 1.5008732777023093) internal successors, (15468), 10504 states have internal predecessors, (15468), 756 states have call successors, (756), 432 states have call predecessors, (756), 592 states have return successors, (1219), 727 states have call predecessors, (1219), 756 states have call successors, (1219) [2025-02-05 17:13:00,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11656 states to 11656 states and 17443 transitions. [2025-02-05 17:13:00,658 INFO L78 Accepts]: Start accepts. Automaton has 11656 states and 17443 transitions. Word has length 130 [2025-02-05 17:13:00,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:13:00,658 INFO L471 AbstractCegarLoop]: Abstraction has 11656 states and 17443 transitions. [2025-02-05 17:13:00,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 2 states have internal predecessors, (100), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:13:00,659 INFO L276 IsEmpty]: Start isEmpty. Operand 11656 states and 17443 transitions. [2025-02-05 17:13:00,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 17:13:00,672 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:00,672 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:00,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 17:13:00,878 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:13:00,878 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:00,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:00,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1283469742, now seen corresponding path program 1 times [2025-02-05 17:13:00,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:00,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210992164] [2025-02-05 17:13:00,879 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:00,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:00,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 17:13:00,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 17:13:00,894 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:00,894 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:00,967 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:13:00,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:00,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210992164] [2025-02-05 17:13:00,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210992164] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:13:00,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1360492233] [2025-02-05 17:13:00,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:00,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:13:00,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:13:00,971 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:13:00,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 17:13:01,030 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 17:13:01,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 17:13:01,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:01,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:01,085 INFO L256 TraceCheckSpWp]: Trace formula consists of 485 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:13:01,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:13:01,139 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 17:13:01,140 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:13:01,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1360492233] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:01,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:13:01,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 17:13:01,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326894640] [2025-02-05 17:13:01,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:01,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:13:01,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:01,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:13:01,142 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:01,142 INFO L87 Difference]: Start difference. First operand 11656 states and 17443 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:13:01,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:13:01,921 INFO L93 Difference]: Finished difference Result 30437 states and 44271 transitions. [2025-02-05 17:13:01,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:13:01,921 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 130 [2025-02-05 17:13:01,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:02,010 INFO L225 Difference]: With dead ends: 30437 [2025-02-05 17:13:02,011 INFO L226 Difference]: Without dead ends: 20914 [2025-02-05 17:13:02,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:02,043 INFO L435 NwaCegarLoop]: 4184 mSDtfsCounter, 4146 mSDsluCounter, 202 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4146 SdHoareTripleChecker+Valid, 4386 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:02,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4146 Valid, 4386 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:13:02,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20914 states. [2025-02-05 17:13:03,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20914 to 20696. [2025-02-05 17:13:03,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20696 states, 18042 states have (on average 1.4581531980933378) internal successors, (26308), 18436 states have internal predecessors, (26308), 1468 states have call successors, (1468), 864 states have call predecessors, (1468), 1184 states have return successors, (2387), 1403 states have call predecessors, (2387), 1468 states have call successors, (2387) [2025-02-05 17:13:03,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20696 states to 20696 states and 30163 transitions. [2025-02-05 17:13:03,305 INFO L78 Accepts]: Start accepts. Automaton has 20696 states and 30163 transitions. Word has length 130 [2025-02-05 17:13:03,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:13:03,306 INFO L471 AbstractCegarLoop]: Abstraction has 20696 states and 30163 transitions. [2025-02-05 17:13:03,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 2 states have internal predecessors, (88), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-02-05 17:13:03,306 INFO L276 IsEmpty]: Start isEmpty. Operand 20696 states and 30163 transitions. [2025-02-05 17:13:03,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-02-05 17:13:03,329 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:03,330 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:03,340 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 17:13:03,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:13:03,536 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:03,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:03,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1570376472, now seen corresponding path program 1 times [2025-02-05 17:13:03,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:03,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384114792] [2025-02-05 17:13:03,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:03,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:03,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 17:13:03,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 17:13:03,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:03,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:03,625 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-02-05 17:13:03,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:03,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384114792] [2025-02-05 17:13:03,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384114792] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:13:03,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [98683742] [2025-02-05 17:13:03,625 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:03,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:13:03,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:13:03,628 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:13:03,631 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 17:13:03,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-02-05 17:13:03,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-02-05 17:13:03,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:03,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:03,737 INFO L256 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:13:03,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:13:03,777 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 17:13:03,778 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:13:03,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [98683742] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:03,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:13:03,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:13:03,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539009208] [2025-02-05 17:13:03,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:03,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:13:03,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:03,779 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:13:03,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:03,782 INFO L87 Difference]: Start difference. First operand 20696 states and 30163 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 17:13:05,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:13:05,287 INFO L93 Difference]: Finished difference Result 56559 states and 81761 transitions. [2025-02-05 17:13:05,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:13:05,288 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 130 [2025-02-05 17:13:05,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:05,465 INFO L225 Difference]: With dead ends: 56559 [2025-02-05 17:13:05,465 INFO L226 Difference]: Without dead ends: 37997 [2025-02-05 17:13:05,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:05,511 INFO L435 NwaCegarLoop]: 4385 mSDtfsCounter, 197 mSDsluCounter, 4182 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 8567 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:05,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 8567 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:13:05,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37997 states. [2025-02-05 17:13:07,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37997 to 37997. [2025-02-05 17:13:07,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37997 states, 32912 states have (on average 1.4311193485658726) internal successors, (47101), 33627 states have internal predecessors, (47101), 2753 states have call successors, (2753), 1690 states have call predecessors, (2753), 2330 states have return successors, (5010), 2695 states have call predecessors, (5010), 2753 states have call successors, (5010) [2025-02-05 17:13:07,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37997 states to 37997 states and 54864 transitions. [2025-02-05 17:13:07,621 INFO L78 Accepts]: Start accepts. Automaton has 37997 states and 54864 transitions. Word has length 130 [2025-02-05 17:13:07,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:13:07,623 INFO L471 AbstractCegarLoop]: Abstraction has 37997 states and 54864 transitions. [2025-02-05 17:13:07,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-02-05 17:13:07,624 INFO L276 IsEmpty]: Start isEmpty. Operand 37997 states and 54864 transitions. [2025-02-05 17:13:07,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 17:13:07,733 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:07,734 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:07,743 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 17:13:07,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 17:13:07,935 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:07,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:07,936 INFO L85 PathProgramCache]: Analyzing trace with hash -673862789, now seen corresponding path program 1 times [2025-02-05 17:13:07,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:07,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077477810] [2025-02-05 17:13:07,936 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:07,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:07,951 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 17:13:07,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 17:13:07,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:07,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:08,068 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-05 17:13:08,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:08,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077477810] [2025-02-05 17:13:08,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077477810] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:13:08,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1388061403] [2025-02-05 17:13:08,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:08,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:13:08,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:13:08,072 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:13:08,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 17:13:08,149 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 17:13:08,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 17:13:08,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:08,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:08,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 639 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:13:08,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:13:08,355 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 17:13:08,357 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:13:08,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1388061403] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:08,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:13:08,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:13:08,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764125757] [2025-02-05 17:13:08,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:08,359 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:13:08,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:08,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:13:08,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:08,360 INFO L87 Difference]: Start difference. First operand 37997 states and 54864 transitions. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 17:13:09,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:13:09,718 INFO L93 Difference]: Finished difference Result 62381 states and 89991 transitions. [2025-02-05 17:13:09,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:13:09,719 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 189 [2025-02-05 17:13:09,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:09,882 INFO L225 Difference]: With dead ends: 62381 [2025-02-05 17:13:09,883 INFO L226 Difference]: Without dead ends: 33881 [2025-02-05 17:13:10,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:10,141 INFO L435 NwaCegarLoop]: 4181 mSDtfsCounter, 4108 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4108 SdHoareTripleChecker+Valid, 4225 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:10,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4108 Valid, 4225 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:13:10,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33881 states. [2025-02-05 17:13:11,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33881 to 26045. [2025-02-05 17:13:11,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26045 states, 22856 states have (on average 1.4088641932096604) internal successors, (32201), 23095 states have internal predecessors, (32201), 1809 states have call successors, (1809), 1186 states have call predecessors, (1809), 1378 states have return successors, (2546), 1771 states have call predecessors, (2546), 1809 states have call successors, (2546) [2025-02-05 17:13:11,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26045 states to 26045 states and 36556 transitions. [2025-02-05 17:13:11,295 INFO L78 Accepts]: Start accepts. Automaton has 26045 states and 36556 transitions. Word has length 189 [2025-02-05 17:13:11,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:13:11,295 INFO L471 AbstractCegarLoop]: Abstraction has 26045 states and 36556 transitions. [2025-02-05 17:13:11,296 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 17:13:11,296 INFO L276 IsEmpty]: Start isEmpty. Operand 26045 states and 36556 transitions. [2025-02-05 17:13:11,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 17:13:11,330 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:11,330 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:11,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 17:13:11,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-05 17:13:11,531 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:11,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:11,533 INFO L85 PathProgramCache]: Analyzing trace with hash -1462486276, now seen corresponding path program 1 times [2025-02-05 17:13:11,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:11,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375972630] [2025-02-05 17:13:11,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:11,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:11,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 17:13:11,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 17:13:11,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:11,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:11,638 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-05 17:13:11,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:11,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375972630] [2025-02-05 17:13:11,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375972630] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:13:11,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [823764253] [2025-02-05 17:13:11,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:11,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:13:11,640 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:13:11,643 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:13:11,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 17:13:11,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 17:13:11,764 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 17:13:11,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:11,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:11,767 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:13:11,769 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:13:11,860 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 17:13:11,860 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:13:11,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [823764253] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:11,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:13:11,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:13:11,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126565318] [2025-02-05 17:13:11,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:11,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:13:11,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:11,861 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:13:11,861 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:11,862 INFO L87 Difference]: Start difference. First operand 26045 states and 36556 transitions. Second operand has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 17:13:13,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:13:13,053 INFO L93 Difference]: Finished difference Result 52627 states and 73537 transitions. [2025-02-05 17:13:13,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:13:13,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 189 [2025-02-05 17:13:13,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:13,193 INFO L225 Difference]: With dead ends: 52627 [2025-02-05 17:13:13,193 INFO L226 Difference]: Without dead ends: 28723 [2025-02-05 17:13:13,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:13,249 INFO L435 NwaCegarLoop]: 4179 mSDtfsCounter, 4125 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4125 SdHoareTripleChecker+Valid, 4222 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:13,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4125 Valid, 4222 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:13:13,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28723 states. [2025-02-05 17:13:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28723 to 28723. [2025-02-05 17:13:14,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28723 states, 25330 states have (on average 1.3730359257797078) internal successors, (34779), 25569 states have internal predecessors, (34779), 1867 states have call successors, (1867), 1332 states have call predecessors, (1867), 1524 states have return successors, (2618), 1829 states have call predecessors, (2618), 1867 states have call successors, (2618) [2025-02-05 17:13:14,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28723 states to 28723 states and 39264 transitions. [2025-02-05 17:13:15,004 INFO L78 Accepts]: Start accepts. Automaton has 28723 states and 39264 transitions. Word has length 189 [2025-02-05 17:13:15,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:13:15,004 INFO L471 AbstractCegarLoop]: Abstraction has 28723 states and 39264 transitions. [2025-02-05 17:13:15,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.666666666666664) internal successors, (155), 3 states have internal predecessors, (155), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-02-05 17:13:15,004 INFO L276 IsEmpty]: Start isEmpty. Operand 28723 states and 39264 transitions. [2025-02-05 17:13:15,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2025-02-05 17:13:15,047 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:15,047 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:15,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 17:13:15,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-05 17:13:15,248 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:15,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:15,249 INFO L85 PathProgramCache]: Analyzing trace with hash 1024898977, now seen corresponding path program 1 times [2025-02-05 17:13:15,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:15,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412256200] [2025-02-05 17:13:15,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:15,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:15,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 17:13:15,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 17:13:15,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:15,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-05 17:13:15,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:15,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412256200] [2025-02-05 17:13:15,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412256200] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:13:15,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998123550] [2025-02-05 17:13:15,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:15,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:13:15,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:13:15,371 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:13:15,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 17:13:15,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 189 statements into 1 equivalence classes. [2025-02-05 17:13:15,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 189 of 189 statements. [2025-02-05 17:13:15,505 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:15,505 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:15,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 17:13:15,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:13:15,574 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-05 17:13:15,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:13:15,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998123550] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:15,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:13:15,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:13:15,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793275803] [2025-02-05 17:13:15,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:15,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:13:15,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:15,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:13:15,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:15,578 INFO L87 Difference]: Start difference. First operand 28723 states and 39264 transitions. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 17:13:17,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:13:17,123 INFO L93 Difference]: Finished difference Result 51390 states and 69066 transitions. [2025-02-05 17:13:17,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:13:17,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 189 [2025-02-05 17:13:17,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:17,239 INFO L225 Difference]: With dead ends: 51390 [2025-02-05 17:13:17,240 INFO L226 Difference]: Without dead ends: 31167 [2025-02-05 17:13:17,285 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:17,286 INFO L435 NwaCegarLoop]: 4240 mSDtfsCounter, 4117 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4117 SdHoareTripleChecker+Valid, 4449 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:17,286 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4117 Valid, 4449 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:13:17,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31167 states. [2025-02-05 17:13:18,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31167 to 31003. [2025-02-05 17:13:18,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31003 states, 27466 states have (on average 1.3486856477098959) internal successors, (37043), 27705 states have internal predecessors, (37043), 1895 states have call successors, (1895), 1448 states have call predecessors, (1895), 1640 states have return successors, (2762), 1857 states have call predecessors, (2762), 1895 states have call successors, (2762) [2025-02-05 17:13:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31003 states to 31003 states and 41700 transitions. [2025-02-05 17:13:18,477 INFO L78 Accepts]: Start accepts. Automaton has 31003 states and 41700 transitions. Word has length 189 [2025-02-05 17:13:18,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:13:18,477 INFO L471 AbstractCegarLoop]: Abstraction has 31003 states and 41700 transitions. [2025-02-05 17:13:18,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 17:13:18,477 INFO L276 IsEmpty]: Start isEmpty. Operand 31003 states and 41700 transitions. [2025-02-05 17:13:18,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 17:13:18,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:18,510 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:18,518 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-05 17:13:18,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:13:18,711 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:18,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:18,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1565769217, now seen corresponding path program 1 times [2025-02-05 17:13:18,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:18,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073017530] [2025-02-05 17:13:18,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:18,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:18,720 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 17:13:18,724 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 17:13:18,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:18,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:18,809 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 74 trivial. 0 not checked. [2025-02-05 17:13:18,810 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:18,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073017530] [2025-02-05 17:13:18,810 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073017530] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:13:18,810 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1575100751] [2025-02-05 17:13:18,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:18,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:13:18,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:13:18,813 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:13:18,815 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-05 17:13:18,876 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 17:13:18,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 17:13:18,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:18,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:18,941 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:13:18,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:13:18,976 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-02-05 17:13:18,977 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:13:18,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1575100751] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:18,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:13:18,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:13:18,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707348365] [2025-02-05 17:13:18,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:18,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:13:18,980 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:18,980 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:13:18,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:18,980 INFO L87 Difference]: Start difference. First operand 31003 states and 41700 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 17:13:20,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 17:13:20,776 INFO L93 Difference]: Finished difference Result 85063 states and 113658 transitions. [2025-02-05 17:13:20,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 17:13:20,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 190 [2025-02-05 17:13:20,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 17:13:20,974 INFO L225 Difference]: With dead ends: 85063 [2025-02-05 17:13:20,974 INFO L226 Difference]: Without dead ends: 56201 [2025-02-05 17:13:21,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:21,037 INFO L435 NwaCegarLoop]: 4376 mSDtfsCounter, 179 mSDsluCounter, 4176 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 8552 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 17:13:21,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 8552 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 17:13:21,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56201 states. [2025-02-05 17:13:22,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56201 to 56199. [2025-02-05 17:13:22,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56199 states, 49448 states have (on average 1.3241587121824947) internal successors, (65477), 49925 states have internal predecessors, (65477), 3629 states have call successors, (3629), 2736 states have call predecessors, (3629), 3120 states have return successors, (6322), 3553 states have call predecessors, (6322), 3629 states have call successors, (6322) [2025-02-05 17:13:23,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56199 states to 56199 states and 75428 transitions. [2025-02-05 17:13:23,371 INFO L78 Accepts]: Start accepts. Automaton has 56199 states and 75428 transitions. Word has length 190 [2025-02-05 17:13:23,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 17:13:23,372 INFO L471 AbstractCegarLoop]: Abstraction has 56199 states and 75428 transitions. [2025-02-05 17:13:23,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-02-05 17:13:23,372 INFO L276 IsEmpty]: Start isEmpty. Operand 56199 states and 75428 transitions. [2025-02-05 17:13:23,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-05 17:13:23,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 17:13:23,462 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13:23,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-05 17:13:23,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-02-05 17:13:23,666 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 17:13:23,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 17:13:23,666 INFO L85 PathProgramCache]: Analyzing trace with hash -1460166588, now seen corresponding path program 1 times [2025-02-05 17:13:23,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 17:13:23,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [742200964] [2025-02-05 17:13:23,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:23,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 17:13:23,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 17:13:23,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 17:13:23,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:23,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-02-05 17:13:23,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 17:13:23,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [742200964] [2025-02-05 17:13:23,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [742200964] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 17:13:23,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990735958] [2025-02-05 17:13:23,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 17:13:23,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 17:13:23,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 17:13:23,774 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 17:13:23,775 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-05 17:13:23,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-05 17:13:23,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-05 17:13:23,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 17:13:23,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 17:13:23,907 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 17:13:23,910 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 17:13:23,973 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-02-05 17:13:23,973 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 17:13:23,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990735958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 17:13:23,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 17:13:23,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 17:13:23,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472290571] [2025-02-05 17:13:23,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 17:13:23,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 17:13:23,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 17:13:23,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 17:13:23,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 17:13:23,977 INFO L87 Difference]: Start difference. First operand 56199 states and 75428 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11)