./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 45212159197fe0bc553796025c4b5584a047c150b6d840572b407bf4bd1f9446 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 06:59:22,645 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 06:59:22,703 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 06:59:22,711 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 06:59:22,711 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 06:59:22,732 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 06:59:22,732 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 06:59:22,732 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 06:59:22,732 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 06:59:22,732 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 06:59:22,733 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 06:59:22,733 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 06:59:22,733 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 06:59:22,733 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 06:59:22,733 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 06:59:22,733 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 06:59:22,733 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 06:59:22,733 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 06:59:22,733 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 06:59:22,733 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 06:59:22,733 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 06:59:22,733 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 06:59:22,733 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 06:59:22,733 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 06:59:22,733 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 06:59:22,733 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 06:59:22,734 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 06:59:22,734 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 06:59:22,734 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 06:59:22,734 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 06:59:22,734 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 06:59:22,734 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 06:59:22,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:59:22,734 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 06:59:22,734 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 06:59:22,734 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 06:59:22,734 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 06:59:22,734 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 06:59:22,734 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 06:59:22,734 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 06:59:22,734 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 06:59:22,734 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 06:59:22,734 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 06:59:22,734 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 45212159197fe0bc553796025c4b5584a047c150b6d840572b407bf4bd1f9446 [2025-03-08 06:59:22,946 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 06:59:22,952 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 06:59:22,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 06:59:22,954 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 06:59:22,954 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 06:59:22,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-1.c [2025-03-08 06:59:24,090 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d027f9d1/40944d2597dd4076b2b5679683374362/FLAGd4e468551 [2025-03-08 06:59:24,691 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 06:59:24,692 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-1.c [2025-03-08 06:59:24,736 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d027f9d1/40944d2597dd4076b2b5679683374362/FLAGd4e468551 [2025-03-08 06:59:25,159 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0d027f9d1/40944d2597dd4076b2b5679683374362 [2025-03-08 06:59:25,161 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 06:59:25,162 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 06:59:25,163 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 06:59:25,163 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 06:59:25,166 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 06:59:25,167 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:59:25" (1/1) ... [2025-03-08 06:59:25,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34513195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:25, skipping insertion in model container [2025-03-08 06:59:25,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 06:59:25" (1/1) ... [2025-03-08 06:59:25,291 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 06:59:26,350 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-1.c[380593,380606] [2025-03-08 06:59:26,376 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-1.c[383339,383352] [2025-03-08 06:59:26,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:59:26,512 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 06:59:27,002 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-1.c[380593,380606] [2025-03-08 06:59:27,006 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label49+token_ring.03.cil-1.c[383339,383352] [2025-03-08 06:59:27,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 06:59:27,058 INFO L204 MainTranslator]: Completed translation [2025-03-08 06:59:27,059 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:27 WrapperNode [2025-03-08 06:59:27,060 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 06:59:27,061 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 06:59:27,061 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 06:59:27,061 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 06:59:27,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:27" (1/1) ... [2025-03-08 06:59:27,131 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:27" (1/1) ... [2025-03-08 06:59:27,489 INFO L138 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 12678 [2025-03-08 06:59:27,490 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 06:59:27,490 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 06:59:27,490 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 06:59:27,490 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 06:59:27,498 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:27" (1/1) ... [2025-03-08 06:59:27,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:27" (1/1) ... [2025-03-08 06:59:27,535 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:27" (1/1) ... [2025-03-08 06:59:27,608 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 06:59:27,608 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:27" (1/1) ... [2025-03-08 06:59:27,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:27" (1/1) ... [2025-03-08 06:59:27,724 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:27" (1/1) ... [2025-03-08 06:59:27,745 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:27" (1/1) ... [2025-03-08 06:59:27,769 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:27" (1/1) ... [2025-03-08 06:59:27,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:27" (1/1) ... [2025-03-08 06:59:27,834 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 06:59:27,835 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 06:59:27,835 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 06:59:27,836 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 06:59:27,836 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:27" (1/1) ... [2025-03-08 06:59:27,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 06:59:27,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:59:27,862 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 06:59:27,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 06:59:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 06:59:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-03-08 06:59:27,886 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-03-08 06:59:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-03-08 06:59:27,886 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-03-08 06:59:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-03-08 06:59:27,887 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-03-08 06:59:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-03-08 06:59:27,887 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-03-08 06:59:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-03-08 06:59:27,887 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-03-08 06:59:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-03-08 06:59:27,887 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-03-08 06:59:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-03-08 06:59:27,887 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-03-08 06:59:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 06:59:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 06:59:27,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 06:59:28,029 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 06:59:28,030 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 06:59:33,831 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L4481: havoc calculate_output3_#t~ret16#1; [2025-03-08 06:59:33,832 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L7469: havoc calculate_output5_#t~ret18#1; [2025-03-08 06:59:33,832 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3033: havoc calculate_output2_#t~ret15#1; [2025-03-08 06:59:33,832 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L10440: havoc calculate_output7_#t~ret20#1; [2025-03-08 06:59:33,833 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L8922: havoc calculate_output6_#t~ret19#1; [2025-03-08 06:59:33,833 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L6035: havoc calculate_output4_#t~ret17#1; [2025-03-08 06:59:33,833 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1543: havoc calculate_output_#t~ret14#1; [2025-03-08 06:59:34,018 INFO L? ?]: Removed 1705 outVars from TransFormulas that were not future-live. [2025-03-08 06:59:34,018 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 06:59:34,074 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 06:59:34,074 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 06:59:34,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:59:34 BoogieIcfgContainer [2025-03-08 06:59:34,075 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 06:59:34,077 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 06:59:34,077 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 06:59:34,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 06:59:34,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 06:59:25" (1/3) ... [2025-03-08 06:59:34,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ea4f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:59:34, skipping insertion in model container [2025-03-08 06:59:34,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 06:59:27" (2/3) ... [2025-03-08 06:59:34,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25ea4f19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 06:59:34, skipping insertion in model container [2025-03-08 06:59:34,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 06:59:34" (3/3) ... [2025-03-08 06:59:34,085 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label49+token_ring.03.cil-1.c [2025-03-08 06:59:34,098 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 06:59:34,099 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label49+token_ring.03.cil-1.c that has 8 procedures, 2346 locations, 1 initial locations, 7 loop locations, and 2 error locations. [2025-03-08 06:59:34,291 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 06:59:34,302 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;@6a7a5fb6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 06:59:34,303 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-08 06:59:34,315 INFO L276 IsEmpty]: Start isEmpty. Operand has 2346 states, 2318 states have (on average 1.8528904227782572) internal successors, (4295), 2322 states have internal predecessors, (4295), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2025-03-08 06:59:34,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:59:34,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:34,333 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] [2025-03-08 06:59:34,333 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:34,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:34,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1700506555, now seen corresponding path program 1 times [2025-03-08 06:59:34,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:34,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102777939] [2025-03-08 06:59:34,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:34,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:34,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:59:34,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:59:34,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:34,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:34,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:34,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:34,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102777939] [2025-03-08 06:59:34,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102777939] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:34,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:34,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:34,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800890410] [2025-03-08 06:59:34,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:34,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:34,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:34,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:34,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:34,851 INFO L87 Difference]: Start difference. First operand has 2346 states, 2318 states have (on average 1.8528904227782572) internal successors, (4295), 2322 states have internal predecessors, (4295), 19 states have call successors, (19), 7 states have call predecessors, (19), 7 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:35,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:35,331 INFO L93 Difference]: Finished difference Result 4841 states and 8905 transitions. [2025-03-08 06:59:35,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 06:59:35,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-08 06:59:35,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:35,356 INFO L225 Difference]: With dead ends: 4841 [2025-03-08 06:59:35,357 INFO L226 Difference]: Without dead ends: 2436 [2025-03-08 06:59:35,367 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:35,371 INFO L435 NwaCegarLoop]: 4211 mSDtfsCounter, 4423 mSDsluCounter, 8508 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4434 SdHoareTripleChecker+Valid, 12719 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:35,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4434 Valid, 12719 Invalid, 310 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [42 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:59:35,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2025-03-08 06:59:35,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2423. [2025-03-08 06:59:35,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2423 states, 2377 states have (on average 1.831299957930164) internal successors, (4353), 2381 states have internal predecessors, (4353), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-03-08 06:59:35,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 4414 transitions. [2025-03-08 06:59:35,496 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 4414 transitions. Word has length 78 [2025-03-08 06:59:35,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:35,497 INFO L471 AbstractCegarLoop]: Abstraction has 2423 states and 4414 transitions. [2025-03-08 06:59:35,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:35,497 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 4414 transitions. [2025-03-08 06:59:35,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:59:35,500 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:35,500 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] [2025-03-08 06:59:35,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 06:59:35,501 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:35,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:35,501 INFO L85 PathProgramCache]: Analyzing trace with hash -443153735, now seen corresponding path program 1 times [2025-03-08 06:59:35,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:35,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590845554] [2025-03-08 06:59:35,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:35,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:35,512 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:59:35,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:59:35,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:35,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:35,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:35,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:35,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590845554] [2025-03-08 06:59:35,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590845554] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:35,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:35,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:35,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436358325] [2025-03-08 06:59:35,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:35,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:35,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:35,684 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:35,684 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:35,684 INFO L87 Difference]: Start difference. First operand 2423 states and 4414 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:35,913 INFO L93 Difference]: Finished difference Result 2738 states and 4899 transitions. [2025-03-08 06:59:35,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:35,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-08 06:59:35,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:35,925 INFO L225 Difference]: With dead ends: 2738 [2025-03-08 06:59:35,926 INFO L226 Difference]: Without dead ends: 2447 [2025-03-08 06:59:35,928 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:35,929 INFO L435 NwaCegarLoop]: 4130 mSDtfsCounter, 4251 mSDsluCounter, 8191 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4262 SdHoareTripleChecker+Valid, 12321 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:35,929 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4262 Valid, 12321 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:59:35,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2447 states. [2025-03-08 06:59:35,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2447 to 2423. [2025-03-08 06:59:35,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2423 states, 2377 states have (on average 1.8304585612116113) internal successors, (4351), 2381 states have internal predecessors, (4351), 31 states have call successors, (31), 13 states have call predecessors, (31), 13 states have return successors, (30), 29 states have call predecessors, (30), 29 states have call successors, (30) [2025-03-08 06:59:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 4412 transitions. [2025-03-08 06:59:35,993 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 4412 transitions. Word has length 78 [2025-03-08 06:59:35,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:35,993 INFO L471 AbstractCegarLoop]: Abstraction has 2423 states and 4412 transitions. [2025-03-08 06:59:35,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:35,993 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 4412 transitions. [2025-03-08 06:59:35,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:59:35,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:35,996 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] [2025-03-08 06:59:35,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 06:59:35,996 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:35,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:35,996 INFO L85 PathProgramCache]: Analyzing trace with hash -651852038, now seen corresponding path program 1 times [2025-03-08 06:59:35,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:35,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599540815] [2025-03-08 06:59:35,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:35,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:36,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:59:36,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:59:36,011 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:36,011 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:36,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:36,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:36,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599540815] [2025-03-08 06:59:36,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599540815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:36,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:36,140 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:36,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487598501] [2025-03-08 06:59:36,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:36,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:36,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:36,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:36,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:36,142 INFO L87 Difference]: Start difference. First operand 2423 states and 4412 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:36,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:36,521 INFO L93 Difference]: Finished difference Result 2885 states and 5109 transitions. [2025-03-08 06:59:36,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:36,522 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-08 06:59:36,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:36,531 INFO L225 Difference]: With dead ends: 2885 [2025-03-08 06:59:36,531 INFO L226 Difference]: Without dead ends: 2594 [2025-03-08 06:59:36,581 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:59:36,582 INFO L435 NwaCegarLoop]: 4251 mSDtfsCounter, 4336 mSDsluCounter, 12728 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4347 SdHoareTripleChecker+Valid, 16979 SdHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:36,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4347 Valid, 16979 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:59:36,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2594 states. [2025-03-08 06:59:36,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2594 to 2557. [2025-03-08 06:59:36,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2492 states have (on average 1.815008025682183) internal successors, (4523), 2497 states have internal predecessors, (4523), 43 states have call successors, (43), 19 states have call predecessors, (43), 20 states have return successors, (45), 42 states have call predecessors, (45), 41 states have call successors, (45) [2025-03-08 06:59:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 4611 transitions. [2025-03-08 06:59:36,641 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 4611 transitions. Word has length 78 [2025-03-08 06:59:36,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:36,641 INFO L471 AbstractCegarLoop]: Abstraction has 2557 states and 4611 transitions. [2025-03-08 06:59:36,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 4611 transitions. [2025-03-08 06:59:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:59:36,643 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:36,643 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] [2025-03-08 06:59:36,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 06:59:36,643 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:36,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:36,645 INFO L85 PathProgramCache]: Analyzing trace with hash -1818548357, now seen corresponding path program 1 times [2025-03-08 06:59:36,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:36,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783041662] [2025-03-08 06:59:36,645 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:36,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:36,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:59:36,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:59:36,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:36,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:36,749 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:36,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:36,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783041662] [2025-03-08 06:59:36,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783041662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:36,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:36,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:36,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186204222] [2025-03-08 06:59:36,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:36,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:36,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:36,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:36,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:36,751 INFO L87 Difference]: Start difference. First operand 2557 states and 4611 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:37,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:37,133 INFO L93 Difference]: Finished difference Result 3349 states and 5802 transitions. [2025-03-08 06:59:37,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:37,133 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-08 06:59:37,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:37,144 INFO L225 Difference]: With dead ends: 3349 [2025-03-08 06:59:37,144 INFO L226 Difference]: Without dead ends: 2924 [2025-03-08 06:59:37,146 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:59:37,147 INFO L435 NwaCegarLoop]: 4245 mSDtfsCounter, 4435 mSDsluCounter, 12705 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4450 SdHoareTripleChecker+Valid, 16950 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:37,147 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4450 Valid, 16950 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:59:37,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2924 states. [2025-03-08 06:59:37,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2924 to 2828. [2025-03-08 06:59:37,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2725 states have (on average 1.7886238532110093) internal successors, (4874), 2734 states have internal predecessors, (4874), 65 states have call successors, (65), 31 states have call predecessors, (65), 36 states have return successors, (79), 66 states have call predecessors, (79), 63 states have call successors, (79) [2025-03-08 06:59:37,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 5018 transitions. [2025-03-08 06:59:37,216 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 5018 transitions. Word has length 78 [2025-03-08 06:59:37,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:37,216 INFO L471 AbstractCegarLoop]: Abstraction has 2828 states and 5018 transitions. [2025-03-08 06:59:37,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:37,216 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 5018 transitions. [2025-03-08 06:59:37,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:59:37,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:37,217 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] [2025-03-08 06:59:37,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 06:59:37,218 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:37,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:37,218 INFO L85 PathProgramCache]: Analyzing trace with hash -1717636390, now seen corresponding path program 1 times [2025-03-08 06:59:37,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:37,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110108743] [2025-03-08 06:59:37,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:37,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:37,224 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:59:37,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:59:37,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:37,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:37,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:37,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:37,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110108743] [2025-03-08 06:59:37,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110108743] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:37,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:37,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:37,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636957733] [2025-03-08 06:59:37,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:37,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:37,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:37,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:37,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:37,297 INFO L87 Difference]: Start difference. First operand 2828 states and 5018 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:37,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:37,479 INFO L93 Difference]: Finished difference Result 3568 states and 6144 transitions. [2025-03-08 06:59:37,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:37,479 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-08 06:59:37,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:37,489 INFO L225 Difference]: With dead ends: 3568 [2025-03-08 06:59:37,490 INFO L226 Difference]: Without dead ends: 2872 [2025-03-08 06:59:37,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:37,493 INFO L435 NwaCegarLoop]: 4121 mSDtfsCounter, 4243 mSDsluCounter, 8172 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4254 SdHoareTripleChecker+Valid, 12293 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:37,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4254 Valid, 12293 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:59:37,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2872 states. [2025-03-08 06:59:37,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2872 to 2828. [2025-03-08 06:59:37,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2828 states, 2725 states have (on average 1.786788990825688) internal successors, (4869), 2734 states have internal predecessors, (4869), 65 states have call successors, (65), 31 states have call predecessors, (65), 36 states have return successors, (79), 66 states have call predecessors, (79), 63 states have call successors, (79) [2025-03-08 06:59:37,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2828 states to 2828 states and 5013 transitions. [2025-03-08 06:59:37,563 INFO L78 Accepts]: Start accepts. Automaton has 2828 states and 5013 transitions. Word has length 78 [2025-03-08 06:59:37,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:37,564 INFO L471 AbstractCegarLoop]: Abstraction has 2828 states and 5013 transitions. [2025-03-08 06:59:37,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:37,564 INFO L276 IsEmpty]: Start isEmpty. Operand 2828 states and 5013 transitions. [2025-03-08 06:59:37,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:59:37,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:37,565 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:37,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 06:59:37,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:37,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:37,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1437286501, now seen corresponding path program 1 times [2025-03-08 06:59:37,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:37,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1114102572] [2025-03-08 06:59:37,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:37,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:37,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:59:37,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:59:37,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:37,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:37,732 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:37,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:37,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1114102572] [2025-03-08 06:59:37,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1114102572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:37,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:37,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 06:59:37,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278157575] [2025-03-08 06:59:37,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:37,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 06:59:37,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:37,734 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 06:59:37,734 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:37,734 INFO L87 Difference]: Start difference. First operand 2828 states and 5013 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:38,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:38,166 INFO L93 Difference]: Finished difference Result 4166 states and 7022 transitions. [2025-03-08 06:59:38,166 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 06:59:38,166 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-08 06:59:38,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:38,179 INFO L225 Difference]: With dead ends: 4166 [2025-03-08 06:59:38,180 INFO L226 Difference]: Without dead ends: 3470 [2025-03-08 06:59:38,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 06:59:38,184 INFO L435 NwaCegarLoop]: 4237 mSDtfsCounter, 4362 mSDsluCounter, 12682 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4377 SdHoareTripleChecker+Valid, 16919 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:38,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4377 Valid, 16919 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 06:59:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3470 states. [2025-03-08 06:59:38,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3470 to 3376. [2025-03-08 06:59:38,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3376 states, 3193 states have (on average 1.7435014093329158) internal successors, (5567), 3216 states have internal predecessors, (5567), 107 states have call successors, (107), 55 states have call predecessors, (107), 74 states have return successors, (169), 112 states have call predecessors, (169), 105 states have call successors, (169) [2025-03-08 06:59:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3376 states to 3376 states and 5843 transitions. [2025-03-08 06:59:38,306 INFO L78 Accepts]: Start accepts. Automaton has 3376 states and 5843 transitions. Word has length 78 [2025-03-08 06:59:38,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:38,306 INFO L471 AbstractCegarLoop]: Abstraction has 3376 states and 5843 transitions. [2025-03-08 06:59:38,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:38,307 INFO L276 IsEmpty]: Start isEmpty. Operand 3376 states and 5843 transitions. [2025-03-08 06:59:38,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:59:38,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:38,308 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] [2025-03-08 06:59:38,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 06:59:38,308 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:38,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:38,309 INFO L85 PathProgramCache]: Analyzing trace with hash 927061690, now seen corresponding path program 1 times [2025-03-08 06:59:38,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:38,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391060101] [2025-03-08 06:59:38,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:38,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:38,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:59:38,316 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:59:38,316 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:38,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:38,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:38,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:38,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391060101] [2025-03-08 06:59:38,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391060101] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:38,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:38,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 06:59:38,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54308180] [2025-03-08 06:59:38,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:38,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 06:59:38,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:38,366 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 06:59:38,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 06:59:38,366 INFO L87 Difference]: Start difference. First operand 3376 states and 5843 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:38,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:38,554 INFO L93 Difference]: Finished difference Result 4678 states and 7824 transitions. [2025-03-08 06:59:38,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:38,555 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-08 06:59:38,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:38,566 INFO L225 Difference]: With dead ends: 4678 [2025-03-08 06:59:38,567 INFO L226 Difference]: Without dead ends: 3434 [2025-03-08 06:59:38,570 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:38,570 INFO L435 NwaCegarLoop]: 4116 mSDtfsCounter, 4239 mSDsluCounter, 8163 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4250 SdHoareTripleChecker+Valid, 12279 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:38,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4250 Valid, 12279 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:59:38,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3434 states. [2025-03-08 06:59:38,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3434 to 3376. [2025-03-08 06:59:38,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3376 states, 3193 states have (on average 1.7406827435014094) internal successors, (5558), 3216 states have internal predecessors, (5558), 107 states have call successors, (107), 55 states have call predecessors, (107), 74 states have return successors, (169), 112 states have call predecessors, (169), 105 states have call successors, (169) [2025-03-08 06:59:38,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3376 states to 3376 states and 5834 transitions. [2025-03-08 06:59:38,655 INFO L78 Accepts]: Start accepts. Automaton has 3376 states and 5834 transitions. Word has length 78 [2025-03-08 06:59:38,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:38,655 INFO L471 AbstractCegarLoop]: Abstraction has 3376 states and 5834 transitions. [2025-03-08 06:59:38,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:38,656 INFO L276 IsEmpty]: Start isEmpty. Operand 3376 states and 5834 transitions. [2025-03-08 06:59:38,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-03-08 06:59:38,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:38,657 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] [2025-03-08 06:59:38,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 06:59:38,658 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:38,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:38,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1557520315, now seen corresponding path program 1 times [2025-03-08 06:59:38,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:38,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686910107] [2025-03-08 06:59:38,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:38,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:38,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-03-08 06:59:38,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-03-08 06:59:38,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:38,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:38,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 06:59:38,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:38,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686910107] [2025-03-08 06:59:38,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686910107] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:38,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 06:59:38,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 06:59:38,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510266502] [2025-03-08 06:59:38,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:38,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 06:59:38,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:38,708 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 06:59:38,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 06:59:38,708 INFO L87 Difference]: Start difference. First operand 3376 states and 5834 transitions. Second operand has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:38,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:38,906 INFO L93 Difference]: Finished difference Result 5776 states and 9478 transitions. [2025-03-08 06:59:38,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 06:59:38,907 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-03-08 06:59:38,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:38,935 INFO L225 Difference]: With dead ends: 5776 [2025-03-08 06:59:38,938 INFO L226 Difference]: Without dead ends: 4533 [2025-03-08 06:59:38,946 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-03-08 06:59:38,947 INFO L435 NwaCegarLoop]: 4373 mSDtfsCounter, 4340 mSDsluCounter, 4308 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4340 SdHoareTripleChecker+Valid, 8681 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 06:59:38,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4340 Valid, 8681 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 06:59:38,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4533 states. [2025-03-08 06:59:39,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4533 to 4524. [2025-03-08 06:59:39,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4524 states, 4166 states have (on average 1.6651464234277484) internal successors, (6937), 4218 states have internal predecessors, (6937), 208 states have call successors, (208), 109 states have call predecessors, (208), 148 states have return successors, (327), 204 states have call predecessors, (327), 206 states have call successors, (327) [2025-03-08 06:59:39,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4524 states to 4524 states and 7472 transitions. [2025-03-08 06:59:39,100 INFO L78 Accepts]: Start accepts. Automaton has 4524 states and 7472 transitions. Word has length 78 [2025-03-08 06:59:39,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:39,101 INFO L471 AbstractCegarLoop]: Abstraction has 4524 states and 7472 transitions. [2025-03-08 06:59:39,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.75) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-08 06:59:39,102 INFO L276 IsEmpty]: Start isEmpty. Operand 4524 states and 7472 transitions. [2025-03-08 06:59:39,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 06:59:39,107 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:39,107 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:39,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 06:59:39,107 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:39,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:39,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1210664997, now seen corresponding path program 1 times [2025-03-08 06:59:39,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:39,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127391284] [2025-03-08 06:59:39,108 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:39,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:39,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 06:59:39,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 06:59:39,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:39,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:39,167 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:59:39,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:39,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127391284] [2025-03-08 06:59:39,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127391284] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:59:39,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093664906] [2025-03-08 06:59:39,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:39,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:59:39,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:59:39,170 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:59:39,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 06:59:39,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 06:59:39,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 06:59:39,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:39,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:39,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:59:39,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:59:39,336 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 06:59:39,336 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:59:39,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093664906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:39,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:59:39,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:59:39,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016962353] [2025-03-08 06:59:39,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:39,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:59:39,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:39,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:59:39,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:39,339 INFO L87 Difference]: Start difference. First operand 4524 states and 7472 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:59:39,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:39,544 INFO L93 Difference]: Finished difference Result 9215 states and 14404 transitions. [2025-03-08 06:59:39,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:59:39,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 126 [2025-03-08 06:59:39,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:39,563 INFO L225 Difference]: With dead ends: 9215 [2025-03-08 06:59:39,563 INFO L226 Difference]: Without dead ends: 6824 [2025-03-08 06:59:39,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 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-03-08 06:59:39,571 INFO L435 NwaCegarLoop]: 4186 mSDtfsCounter, 4142 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4142 SdHoareTripleChecker+Valid, 4390 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-03-08 06:59:39,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4142 Valid, 4390 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:59:39,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6824 states. [2025-03-08 06:59:39,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6824 to 6802. [2025-03-08 06:59:39,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6802 states, 6112 states have (on average 1.5965314136125655) internal successors, (9758), 6213 states have internal predecessors, (9758), 392 states have call successors, (392), 217 states have call predecessors, (392), 296 states have return successors, (625), 379 states have call predecessors, (625), 390 states have call successors, (625) [2025-03-08 06:59:39,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6802 states to 6802 states and 10775 transitions. [2025-03-08 06:59:39,796 INFO L78 Accepts]: Start accepts. Automaton has 6802 states and 10775 transitions. Word has length 126 [2025-03-08 06:59:39,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:39,797 INFO L471 AbstractCegarLoop]: Abstraction has 6802 states and 10775 transitions. [2025-03-08 06:59:39,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:59:39,797 INFO L276 IsEmpty]: Start isEmpty. Operand 6802 states and 10775 transitions. [2025-03-08 06:59:39,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 06:59:39,804 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:39,804 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:39,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 06:59:40,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:59:40,008 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:40,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:40,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1946416479, now seen corresponding path program 1 times [2025-03-08 06:59:40,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:40,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055642507] [2025-03-08 06:59:40,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:40,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:40,015 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 06:59:40,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 06:59:40,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:40,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:40,070 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:59:40,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:40,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055642507] [2025-03-08 06:59:40,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055642507] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:59:40,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249363855] [2025-03-08 06:59:40,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:40,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:59:40,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:59:40,073 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:59:40,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 06:59:40,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 06:59:40,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 06:59:40,162 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:40,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:40,165 INFO L256 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:59:40,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:59:40,217 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 06:59:40,217 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:59:40,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249363855] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:40,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:59:40,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:59:40,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717207660] [2025-03-08 06:59:40,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:40,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:59:40,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:40,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:59:40,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:40,219 INFO L87 Difference]: Start difference. First operand 6802 states and 10775 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:59:40,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:40,592 INFO L93 Difference]: Finished difference Result 16007 states and 24325 transitions. [2025-03-08 06:59:40,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:59:40,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 126 [2025-03-08 06:59:40,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:40,634 INFO L225 Difference]: With dead ends: 16007 [2025-03-08 06:59:40,634 INFO L226 Difference]: Without dead ends: 11338 [2025-03-08 06:59:40,664 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 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-03-08 06:59:40,669 INFO L435 NwaCegarLoop]: 4186 mSDtfsCounter, 4136 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4136 SdHoareTripleChecker+Valid, 4390 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-03-08 06:59:40,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4136 Valid, 4390 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:59:40,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11338 states. [2025-03-08 06:59:41,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11338 to 11298. [2025-03-08 06:59:41,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11298 states, 9946 states have (on average 1.5371003418459683) internal successors, (15288), 10145 states have internal predecessors, (15288), 758 states have call successors, (758), 433 states have call predecessors, (758), 592 states have return successors, (1219), 727 states have call predecessors, (1219), 756 states have call successors, (1219) [2025-03-08 06:59:41,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11298 states to 11298 states and 17265 transitions. [2025-03-08 06:59:41,187 INFO L78 Accepts]: Start accepts. Automaton has 11298 states and 17265 transitions. Word has length 126 [2025-03-08 06:59:41,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:41,188 INFO L471 AbstractCegarLoop]: Abstraction has 11298 states and 17265 transitions. [2025-03-08 06:59:41,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:59:41,188 INFO L276 IsEmpty]: Start isEmpty. Operand 11298 states and 17265 transitions. [2025-03-08 06:59:41,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 06:59:41,197 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:41,197 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:41,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 06:59:41,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 06:59:41,398 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:41,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:41,398 INFO L85 PathProgramCache]: Analyzing trace with hash -1882221031, now seen corresponding path program 1 times [2025-03-08 06:59:41,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:41,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913972052] [2025-03-08 06:59:41,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:41,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:41,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 06:59:41,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 06:59:41,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:41,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:41,460 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:59:41,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:41,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913972052] [2025-03-08 06:59:41,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913972052] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:59:41,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1502779180] [2025-03-08 06:59:41,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:41,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:59:41,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:59:41,463 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:59:41,465 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 06:59:41,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 06:59:41,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 06:59:41,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:41,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:41,547 INFO L256 TraceCheckSpWp]: Trace formula consists of 487 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:59:41,550 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:59:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 06:59:41,591 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:59:41,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1502779180] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:41,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:59:41,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-03-08 06:59:41,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593836493] [2025-03-08 06:59:41,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:41,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:59:41,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:41,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:59:41,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:41,592 INFO L87 Difference]: Start difference. First operand 11298 states and 17265 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:59:42,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:42,152 INFO L93 Difference]: Finished difference Result 29363 states and 43737 transitions. [2025-03-08 06:59:42,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:59:42,153 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 126 [2025-03-08 06:59:42,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:42,215 INFO L225 Difference]: With dead ends: 29363 [2025-03-08 06:59:42,215 INFO L226 Difference]: Without dead ends: 20198 [2025-03-08 06:59:42,240 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 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-03-08 06:59:42,241 INFO L435 NwaCegarLoop]: 4186 mSDtfsCounter, 4148 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4148 SdHoareTripleChecker+Valid, 4390 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-03-08 06:59:42,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4148 Valid, 4390 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:59:42,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20198 states. [2025-03-08 06:59:42,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20198 to 20122. [2025-03-08 06:59:42,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20122 states, 17466 states have (on average 1.4938738119775563) internal successors, (26092), 17861 states have internal predecessors, (26092), 1470 states have call successors, (1470), 865 states have call predecessors, (1470), 1184 states have return successors, (2387), 1403 states have call predecessors, (2387), 1468 states have call successors, (2387) [2025-03-08 06:59:43,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20122 states to 20122 states and 29949 transitions. [2025-03-08 06:59:43,016 INFO L78 Accepts]: Start accepts. Automaton has 20122 states and 29949 transitions. Word has length 126 [2025-03-08 06:59:43,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:43,016 INFO L471 AbstractCegarLoop]: Abstraction has 20122 states and 29949 transitions. [2025-03-08 06:59:43,016 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-03-08 06:59:43,017 INFO L276 IsEmpty]: Start isEmpty. Operand 20122 states and 29949 transitions. [2025-03-08 06:59:43,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 06:59:43,033 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:43,033 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:43,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 06:59:43,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:59:43,238 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:43,238 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:43,238 INFO L85 PathProgramCache]: Analyzing trace with hash -2107772973, now seen corresponding path program 1 times [2025-03-08 06:59:43,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:43,239 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398310658] [2025-03-08 06:59:43,239 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:43,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:43,244 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 06:59:43,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 06:59:43,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:43,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:43,284 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 06:59:43,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:43,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398310658] [2025-03-08 06:59:43,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398310658] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:59:43,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206583632] [2025-03-08 06:59:43,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:43,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:59:43,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:59:43,287 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:59:43,288 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 06:59:43,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 06:59:43,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 06:59:43,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:43,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:43,369 INFO L256 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:59:43,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:59:43,387 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 06:59:43,388 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:59:43,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [206583632] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:43,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:59:43,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:59:43,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439678289] [2025-03-08 06:59:43,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:43,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:59:43,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:43,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:59:43,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:43,389 INFO L87 Difference]: Start difference. First operand 20122 states and 29949 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 06:59:44,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:44,803 INFO L93 Difference]: Finished difference Result 54691 states and 80613 transitions. [2025-03-08 06:59:44,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:59:44,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 126 [2025-03-08 06:59:44,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:44,991 INFO L225 Difference]: With dead ends: 54691 [2025-03-08 06:59:44,991 INFO L226 Difference]: Without dead ends: 36703 [2025-03-08 06:59:45,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 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-03-08 06:59:45,036 INFO L435 NwaCegarLoop]: 4380 mSDtfsCounter, 190 mSDsluCounter, 4185 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 8565 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-03-08 06:59:45,036 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 8565 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:59:45,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36703 states. [2025-03-08 06:59:46,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36703 to 36703. [2025-03-08 06:59:46,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36703 states, 31616 states have (on average 1.460178390688259) internal successors, (46165), 32332 states have internal predecessors, (46165), 2755 states have call successors, (2755), 1691 states have call predecessors, (2755), 2330 states have return successors, (5010), 2695 states have call predecessors, (5010), 2753 states have call successors, (5010) [2025-03-08 06:59:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36703 states to 36703 states and 53930 transitions. [2025-03-08 06:59:46,354 INFO L78 Accepts]: Start accepts. Automaton has 36703 states and 53930 transitions. Word has length 126 [2025-03-08 06:59:46,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:46,355 INFO L471 AbstractCegarLoop]: Abstraction has 36703 states and 53930 transitions. [2025-03-08 06:59:46,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 3 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2025-03-08 06:59:46,355 INFO L276 IsEmpty]: Start isEmpty. Operand 36703 states and 53930 transitions. [2025-03-08 06:59:46,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 06:59:46,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:46,448 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, 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] [2025-03-08 06:59:46,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 06:59:46,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:59:46,653 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:46,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:46,654 INFO L85 PathProgramCache]: Analyzing trace with hash 375053934, now seen corresponding path program 1 times [2025-03-08 06:59:46,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:46,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546387460] [2025-03-08 06:59:46,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:46,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:46,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 06:59:46,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 06:59:46,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:46,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 06:59:46,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:46,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546387460] [2025-03-08 06:59:46,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546387460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:59:46,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692753320] [2025-03-08 06:59:46,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:46,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:59:46,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:59:46,734 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:59:46,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 06:59:46,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 06:59:46,832 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 06:59:46,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:46,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:46,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 637 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:59:46,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:59:46,912 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-08 06:59:46,913 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:59:46,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692753320] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:46,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:59:46,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:59:46,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57336365] [2025-03-08 06:59:46,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:46,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:59:46,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:46,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:59:46,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:46,918 INFO L87 Difference]: Start difference. First operand 36703 states and 53930 transitions. Second operand has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-03-08 06:59:47,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:47,986 INFO L93 Difference]: Finished difference Result 60345 states and 88615 transitions. [2025-03-08 06:59:47,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:59:47,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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 181 [2025-03-08 06:59:47,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:48,104 INFO L225 Difference]: With dead ends: 60345 [2025-03-08 06:59:48,104 INFO L226 Difference]: Without dead ends: 32755 [2025-03-08 06:59:48,159 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 181 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-03-08 06:59:48,160 INFO L435 NwaCegarLoop]: 4183 mSDtfsCounter, 4116 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4116 SdHoareTripleChecker+Valid, 4227 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-03-08 06:59:48,160 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4116 Valid, 4227 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:59:48,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32755 states. [2025-03-08 06:59:49,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32755 to 25271. [2025-03-08 06:59:49,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25271 states, 22080 states have (on average 1.433197463768116) internal successors, (31645), 22320 states have internal predecessors, (31645), 1811 states have call successors, (1811), 1187 states have call predecessors, (1811), 1378 states have return successors, (2546), 1771 states have call predecessors, (2546), 1809 states have call successors, (2546) [2025-03-08 06:59:49,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25271 states to 25271 states and 36002 transitions. [2025-03-08 06:59:49,679 INFO L78 Accepts]: Start accepts. Automaton has 25271 states and 36002 transitions. Word has length 181 [2025-03-08 06:59:49,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:49,679 INFO L471 AbstractCegarLoop]: Abstraction has 25271 states and 36002 transitions. [2025-03-08 06:59:49,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 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-03-08 06:59:49,679 INFO L276 IsEmpty]: Start isEmpty. Operand 25271 states and 36002 transitions. [2025-03-08 06:59:49,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 06:59:49,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:49,712 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, 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] [2025-03-08 06:59:49,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 06:59:49,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 06:59:49,917 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:49,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:49,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1730216527, now seen corresponding path program 1 times [2025-03-08 06:59:49,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:49,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519862379] [2025-03-08 06:59:49,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:49,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:50,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 06:59:50,070 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 06:59:50,070 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:50,070 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:50,121 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 06:59:50,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:50,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519862379] [2025-03-08 06:59:50,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1519862379] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:59:50,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [697054754] [2025-03-08 06:59:50,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:50,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:59:50,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:59:50,123 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:59:50,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 06:59:50,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 06:59:50,222 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 06:59:50,222 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:50,222 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:50,224 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:59:50,226 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:59:50,274 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-08 06:59:50,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:59:50,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [697054754] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:50,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:59:50,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:59:50,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942886889] [2025-03-08 06:59:50,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:50,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:59:50,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:50,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:59:50,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:50,276 INFO L87 Difference]: Start difference. First operand 25271 states and 36002 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 06:59:50,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:50,988 INFO L93 Difference]: Finished difference Result 51079 states and 72429 transitions. [2025-03-08 06:59:50,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:59:50,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 181 [2025-03-08 06:59:50,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:51,074 INFO L225 Difference]: With dead ends: 51079 [2025-03-08 06:59:51,074 INFO L226 Difference]: Without dead ends: 27949 [2025-03-08 06:59:51,122 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 181 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-03-08 06:59:51,122 INFO L435 NwaCegarLoop]: 4181 mSDtfsCounter, 4133 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4133 SdHoareTripleChecker+Valid, 4224 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-03-08 06:59:51,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4133 Valid, 4224 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:59:51,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27949 states. [2025-03-08 06:59:52,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27949 to 27949. [2025-03-08 06:59:52,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27949 states, 24554 states have (on average 1.3937851266596073) internal successors, (34223), 24794 states have internal predecessors, (34223), 1869 states have call successors, (1869), 1333 states have call predecessors, (1869), 1524 states have return successors, (2618), 1829 states have call predecessors, (2618), 1867 states have call successors, (2618) [2025-03-08 06:59:52,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27949 states to 27949 states and 38710 transitions. [2025-03-08 06:59:52,268 INFO L78 Accepts]: Start accepts. Automaton has 27949 states and 38710 transitions. Word has length 181 [2025-03-08 06:59:52,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:52,269 INFO L471 AbstractCegarLoop]: Abstraction has 27949 states and 38710 transitions. [2025-03-08 06:59:52,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-03-08 06:59:52,269 INFO L276 IsEmpty]: Start isEmpty. Operand 27949 states and 38710 transitions. [2025-03-08 06:59:52,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-03-08 06:59:52,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:52,300 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:52,307 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-08 06:59:52,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:59:52,501 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:52,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:52,502 INFO L85 PathProgramCache]: Analyzing trace with hash 220171304, now seen corresponding path program 1 times [2025-03-08 06:59:52,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:52,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432718294] [2025-03-08 06:59:52,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:52,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:52,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 06:59:52,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 06:59:52,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:52,521 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:52,583 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 06:59:52,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:52,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432718294] [2025-03-08 06:59:52,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432718294] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:59:52,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280408761] [2025-03-08 06:59:52,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:52,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:59:52,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:59:52,585 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:59:52,587 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 06:59:52,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-03-08 06:59:52,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-03-08 06:59:52,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:52,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:52,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 625 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 06:59:52,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:59:52,732 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 69 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-08 06:59:52,732 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:59:52,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280408761] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:52,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:59:52,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:59:52,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522363438] [2025-03-08 06:59:52,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:52,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:59:52,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:52,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:59:52,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:52,733 INFO L87 Difference]: Start difference. First operand 27949 states and 38710 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 06:59:53,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:53,569 INFO L93 Difference]: Finished difference Result 50058 states and 68174 transitions. [2025-03-08 06:59:53,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:59:53,570 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 181 [2025-03-08 06:59:53,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:53,663 INFO L225 Difference]: With dead ends: 50058 [2025-03-08 06:59:53,663 INFO L226 Difference]: Without dead ends: 30393 [2025-03-08 06:59:53,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 181 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-03-08 06:59:53,699 INFO L435 NwaCegarLoop]: 4238 mSDtfsCounter, 4111 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4111 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-03-08 06:59:53,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4111 Valid, 4449 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:59:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30393 states. [2025-03-08 06:59:54,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30393 to 30229. [2025-03-08 06:59:54,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30229 states, 26690 states have (on average 1.367066316972649) internal successors, (36487), 26930 states have internal predecessors, (36487), 1897 states have call successors, (1897), 1449 states have call predecessors, (1897), 1640 states have return successors, (2762), 1857 states have call predecessors, (2762), 1895 states have call successors, (2762) [2025-03-08 06:59:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30229 states to 30229 states and 41146 transitions. [2025-03-08 06:59:54,630 INFO L78 Accepts]: Start accepts. Automaton has 30229 states and 41146 transitions. Word has length 181 [2025-03-08 06:59:54,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:54,631 INFO L471 AbstractCegarLoop]: Abstraction has 30229 states and 41146 transitions. [2025-03-08 06:59:54,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 3 states have call successors, (10), 3 states have call predecessors, (10), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-03-08 06:59:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 30229 states and 41146 transitions. [2025-03-08 06:59:54,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-03-08 06:59:54,662 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:54,663 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 06:59:54,670 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 06:59:54,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:59:54,864 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 06:59:54,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 06:59:54,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1716349116, now seen corresponding path program 1 times [2025-03-08 06:59:54,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 06:59:54,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518775819] [2025-03-08 06:59:54,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:54,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 06:59:54,870 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 06:59:54,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 06:59:54,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:54,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:54,914 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-08 06:59:54,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 06:59:54,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518775819] [2025-03-08 06:59:54,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518775819] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 06:59:54,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046360299] [2025-03-08 06:59:54,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 06:59:54,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 06:59:54,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 06:59:54,916 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 06:59:54,918 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 06:59:54,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-03-08 06:59:55,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-03-08 06:59:55,013 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 06:59:55,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 06:59:55,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 06:59:55,017 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 06:59:55,159 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-08 06:59:55,159 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 06:59:55,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046360299] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 06:59:55,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 06:59:55,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 06:59:55,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553726187] [2025-03-08 06:59:55,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 06:59:55,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 06:59:55,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 06:59:55,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 06:59:55,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 06:59:55,160 INFO L87 Difference]: Start difference. First operand 30229 states and 41146 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 06:59:57,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 06:59:57,597 INFO L93 Difference]: Finished difference Result 82901 states and 112156 transitions. [2025-03-08 06:59:57,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 06:59:57,597 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 182 [2025-03-08 06:59:57,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 06:59:57,921 INFO L225 Difference]: With dead ends: 82901 [2025-03-08 06:59:57,921 INFO L226 Difference]: Without dead ends: 54813 [2025-03-08 06:59:57,961 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 182 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-03-08 06:59:57,962 INFO L435 NwaCegarLoop]: 4384 mSDtfsCounter, 184 mSDsluCounter, 4180 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 8564 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-03-08 06:59:57,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 8564 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 06:59:57,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54813 states. [2025-03-08 06:59:59,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54813 to 54809. [2025-03-08 06:59:59,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54809 states, 48056 states have (on average 1.342704344930914) internal successors, (64525), 48534 states have internal predecessors, (64525), 3631 states have call successors, (3631), 2737 states have call predecessors, (3631), 3120 states have return successors, (6322), 3553 states have call predecessors, (6322), 3629 states have call successors, (6322) [2025-03-08 06:59:59,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54809 states to 54809 states and 74478 transitions. [2025-03-08 06:59:59,875 INFO L78 Accepts]: Start accepts. Automaton has 54809 states and 74478 transitions. Word has length 182 [2025-03-08 06:59:59,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 06:59:59,876 INFO L471 AbstractCegarLoop]: Abstraction has 54809 states and 74478 transitions. [2025-03-08 06:59:59,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 06:59:59,876 INFO L276 IsEmpty]: Start isEmpty. Operand 54809 states and 74478 transitions. [2025-03-08 06:59:59,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 06:59:59,935 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 06:59:59,935 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, 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] [2025-03-08 06:59:59,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-08 07:00:00,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 07:00:00,140 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:00:00,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:00:00,140 INFO L85 PathProgramCache]: Analyzing trace with hash 406158607, now seen corresponding path program 1 times [2025-03-08 07:00:00,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:00:00,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68663045] [2025-03-08 07:00:00,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:00,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:00:00,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 07:00:00,149 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 07:00:00,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:00,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:00,196 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-03-08 07:00:00,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:00:00,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68663045] [2025-03-08 07:00:00,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68663045] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:00:00,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120106907] [2025-03-08 07:00:00,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:00,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:00:00,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:00:00,199 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:00:00,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 07:00:00,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 07:00:00,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 07:00:00,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:00,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:00,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:00:00,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:00:00,334 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 87 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 07:00:00,335 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:00:00,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120106907] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:00:00,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:00:00,335 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 07:00:00,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099318063] [2025-03-08 07:00:00,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:00:00,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:00:00,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:00:00,336 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:00:00,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:00:00,336 INFO L87 Difference]: Start difference. First operand 54809 states and 74478 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 07:00:02,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:00:02,314 INFO L93 Difference]: Finished difference Result 111357 states and 152237 transitions. [2025-03-08 07:00:02,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:00:02,314 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 183 [2025-03-08 07:00:02,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:00:02,538 INFO L225 Difference]: With dead ends: 111357 [2025-03-08 07:00:02,538 INFO L226 Difference]: Without dead ends: 58697 [2025-03-08 07:00:02,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 183 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-03-08 07:00:02,651 INFO L435 NwaCegarLoop]: 4189 mSDtfsCounter, 4143 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4143 SdHoareTripleChecker+Valid, 4231 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-03-08 07:00:02,652 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4143 Valid, 4231 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:00:02,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58697 states. [2025-03-08 07:00:04,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58697 to 54809. [2025-03-08 07:00:04,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54809 states, 48056 states have (on average 1.3223947061761279) internal successors, (63549), 48534 states have internal predecessors, (63549), 3631 states have call successors, (3631), 2737 states have call predecessors, (3631), 3120 states have return successors, (5974), 3553 states have call predecessors, (5974), 3629 states have call successors, (5974) [2025-03-08 07:00:05,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54809 states to 54809 states and 73154 transitions. [2025-03-08 07:00:05,083 INFO L78 Accepts]: Start accepts. Automaton has 54809 states and 73154 transitions. Word has length 183 [2025-03-08 07:00:05,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 07:00:05,084 INFO L471 AbstractCegarLoop]: Abstraction has 54809 states and 73154 transitions. [2025-03-08 07:00:05,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 3 states have call successors, (12), 3 states have call predecessors, (12), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 07:00:05,084 INFO L276 IsEmpty]: Start isEmpty. Operand 54809 states and 73154 transitions. [2025-03-08 07:00:05,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-08 07:00:05,137 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 07:00:05,138 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 07:00:05,144 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 07:00:05,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-08 07:00:05,338 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 07:00:05,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 07:00:05,339 INFO L85 PathProgramCache]: Analyzing trace with hash -108244021, now seen corresponding path program 1 times [2025-03-08 07:00:05,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 07:00:05,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716359034] [2025-03-08 07:00:05,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:05,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 07:00:05,345 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 07:00:05,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 07:00:05,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:05,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:05,562 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-08 07:00:05,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 07:00:05,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716359034] [2025-03-08 07:00:05,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716359034] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 07:00:05,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1213067768] [2025-03-08 07:00:05,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 07:00:05,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 07:00:05,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 07:00:05,564 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 07:00:05,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 07:00:05,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-03-08 07:00:05,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-03-08 07:00:05,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 07:00:05,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 07:00:05,674 INFO L256 TraceCheckSpWp]: Trace formula consists of 622 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 07:00:05,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 07:00:05,692 INFO L134 CoverageAnalysis]: Checked inductivity of 118 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 07:00:05,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 07:00:05,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1213067768] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 07:00:05,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 07:00:05,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 07:00:05,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360763804] [2025-03-08 07:00:05,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 07:00:05,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 07:00:05,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 07:00:05,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 07:00:05,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 07:00:05,694 INFO L87 Difference]: Start difference. First operand 54809 states and 73154 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2025-03-08 07:00:09,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 07:00:09,157 INFO L93 Difference]: Finished difference Result 157893 states and 210974 transitions. [2025-03-08 07:00:09,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 07:00:09,158 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 3 states have call successors, (12), 3 states have call predecessors, (12), 2 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 183 [2025-03-08 07:00:09,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 07:00:09,626 INFO L225 Difference]: With dead ends: 157893 [2025-03-08 07:00:09,626 INFO L226 Difference]: Without dead ends: 105233 [2025-03-08 07:00:09,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 183 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-03-08 07:00:09,744 INFO L435 NwaCegarLoop]: 4383 mSDtfsCounter, 194 mSDsluCounter, 4178 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 8561 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-03-08 07:00:09,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 8561 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 07:00:09,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105233 states.