./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.03.cil-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/Problem05_label46+token_ring.03.cil-1.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 5055f39b9198ec38ad0f2881791eb80b1e4ab6fc763077f931bae502928055b4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:22:51,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:22:51,754 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:22:51,758 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:22:51,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:22:51,773 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:22:51,774 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:22:51,774 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:22:51,774 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:22:51,774 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:22:51,774 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:22:51,774 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:22:51,774 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:22:51,775 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:22:51,775 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:22:51,775 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:22:51,775 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:22:51,775 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:22:51,775 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:22:51,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:22:51,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:22:51,775 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:22:51,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:22:51,776 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:22:51,776 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:22:51,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:22:51,776 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:22:51,776 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:22:51,776 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:22:51,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:22:51,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:22:51,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:22:51,776 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:22:51,776 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:22:51,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:22:51,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:22:51,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:22:51,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:22:51,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:22:51,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:22:51,777 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:22:51,777 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:22:51,777 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:22:51,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:22:51,777 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:22:51,777 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:22:51,777 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:22:51,777 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:22:51,777 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 5055f39b9198ec38ad0f2881791eb80b1e4ab6fc763077f931bae502928055b4 [2025-01-09 05:22:51,972 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:22:51,977 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:22:51,978 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:22:51,979 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:22:51,979 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:22:51,980 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label46+token_ring.03.cil-1.c [2025-01-09 05:22:53,196 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4602bd0ff/0a05bd2ba31748dcbbeaf6684a25e5bd/FLAGd630765e6 [2025-01-09 05:22:53,855 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:22:53,856 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.03.cil-1.c [2025-01-09 05:22:53,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4602bd0ff/0a05bd2ba31748dcbbeaf6684a25e5bd/FLAGd630765e6 [2025-01-09 05:22:54,299 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4602bd0ff/0a05bd2ba31748dcbbeaf6684a25e5bd [2025-01-09 05:22:54,301 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:22:54,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:22:54,307 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:22:54,307 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:22:54,311 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:22:54,312 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:22:54" (1/1) ... [2025-01-09 05:22:54,313 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dc8aaab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:54, skipping insertion in model container [2025-01-09 05:22:54,313 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:22:54" (1/1) ... [2025-01-09 05:22:54,603 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:22:55,867 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.03.cil-1.c[382357,382370] [2025-01-09 05:22:55,892 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.03.cil-1.c[383339,383352] [2025-01-09 05:22:56,034 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:22:56,042 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:22:56,523 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.03.cil-1.c[382357,382370] [2025-01-09 05:22:56,527 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label46+token_ring.03.cil-1.c[383339,383352] [2025-01-09 05:22:56,538 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:22:56,582 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:22:56,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:56 WrapperNode [2025-01-09 05:22:56,584 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:22:56,585 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:22:56,585 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:22:56,585 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:22:56,590 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:56" (1/1) ... [2025-01-09 05:22:56,657 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:56" (1/1) ... [2025-01-09 05:22:56,927 INFO L138 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 12678 [2025-01-09 05:22:56,928 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:22:56,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:22:56,929 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:22:56,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:22:56,936 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:56" (1/1) ... [2025-01-09 05:22:56,937 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:56" (1/1) ... [2025-01-09 05:22:56,984 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:56" (1/1) ... [2025-01-09 05:22:57,056 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-01-09 05:22:57,057 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:56" (1/1) ... [2025-01-09 05:22:57,057 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:56" (1/1) ... [2025-01-09 05:22:57,346 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:56" (1/1) ... [2025-01-09 05:22:57,359 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:56" (1/1) ... [2025-01-09 05:22:57,385 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:56" (1/1) ... [2025-01-09 05:22:57,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:56" (1/1) ... [2025-01-09 05:22:57,419 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:56" (1/1) ... [2025-01-09 05:22:57,457 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:22:57,458 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:22:57,458 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:22:57,458 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:22:57,459 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:56" (1/1) ... [2025-01-09 05:22:57,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:22:57,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:22:57,488 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 05:22:57,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 05:22:57,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:22:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:22:57,511 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:22:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:22:57,511 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:22:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:22:57,511 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:22:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 05:22:57,511 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 05:22:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:22:57,511 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:22:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:22:57,511 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:22:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:22:57,511 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:22:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:22:57,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:22:57,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:22:57,580 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:22:57,581 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:23:04,179 INFO L? ?]: Removed 1705 outVars from TransFormulas that were not future-live. [2025-01-09 05:23:04,180 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:23:04,240 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:23:04,240 INFO L312 CfgBuilder]: Removed 7 assume(true) statements. [2025-01-09 05:23:04,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:23:04 BoogieIcfgContainer [2025-01-09 05:23:04,240 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:23:04,245 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:23:04,245 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:23:04,249 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:23:04,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:22:54" (1/3) ... [2025-01-09 05:23:04,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb6e951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:23:04, skipping insertion in model container [2025-01-09 05:23:04,249 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:22:56" (2/3) ... [2025-01-09 05:23:04,249 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bb6e951 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:23:04, skipping insertion in model container [2025-01-09 05:23:04,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:23:04" (3/3) ... [2025-01-09 05:23:04,251 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label46+token_ring.03.cil-1.c [2025-01-09 05:23:04,263 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:23:04,267 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label46+token_ring.03.cil-1.c that has 8 procedures, 2346 locations, 1 initial locations, 7 loop locations, and 2 error locations. [2025-01-09 05:23:04,358 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:23:04,365 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;@45485bf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:23:04,365 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:23:04,374 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-01-09 05:23:04,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 05:23:04,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:04,382 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-01-09 05:23:04,382 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:04,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:04,386 INFO L85 PathProgramCache]: Analyzing trace with hash 214767506, now seen corresponding path program 1 times [2025-01-09 05:23:04,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:04,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416853379] [2025-01-09 05:23:04,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:04,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:04,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 05:23:04,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 05:23:04,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:04,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:04,571 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:04,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:04,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416853379] [2025-01-09 05:23:04,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416853379] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:04,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:04,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:23:04,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057943722] [2025-01-09 05:23:04,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:04,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:23:04,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:04,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:23:04,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:23:04,595 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 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:04,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:04,778 INFO L93 Difference]: Finished difference Result 4686 states and 8657 transitions. [2025-01-09 05:23:04,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:23:04,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 78 [2025-01-09 05:23:04,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:04,797 INFO L225 Difference]: With dead ends: 4686 [2025-01-09 05:23:04,797 INFO L226 Difference]: Without dead ends: 2278 [2025-01-09 05:23:04,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:23:04,808 INFO L435 NwaCegarLoop]: 4261 mSDtfsCounter, 235 mSDsluCounter, 4022 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 8283 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:23:04,809 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 8283 Invalid, 2 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:23:04,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2025-01-09 05:23:04,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2278. [2025-01-09 05:23:04,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2278 states, 2251 states have (on average 1.8467347845402045) internal successors, (4157), 2254 states have internal predecessors, (4157), 19 states have call successors, (19), 7 states have call predecessors, (19), 6 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2025-01-09 05:23:04,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 4193 transitions. [2025-01-09 05:23:04,929 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 4193 transitions. Word has length 78 [2025-01-09 05:23:04,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:04,930 INFO L471 AbstractCegarLoop]: Abstraction has 2278 states and 4193 transitions. [2025-01-09 05:23:04,931 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-09 05:23:04,931 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 4193 transitions. [2025-01-09 05:23:04,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 05:23:04,933 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:04,933 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-01-09 05:23:04,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:23:04,934 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:04,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:04,935 INFO L85 PathProgramCache]: Analyzing trace with hash -1693690284, now seen corresponding path program 1 times [2025-01-09 05:23:04,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:04,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468800210] [2025-01-09 05:23:04,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:04,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:04,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 05:23:04,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 05:23:04,967 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:04,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:05,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:05,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468800210] [2025-01-09 05:23:05,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468800210] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:05,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:05,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:23:05,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233169057] [2025-01-09 05:23:05,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:05,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:23:05,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:05,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:23:05,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:23:05,124 INFO L87 Difference]: Start difference. First operand 2278 states and 4193 transitions. 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-01-09 05:23:05,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:05,443 INFO L93 Difference]: Finished difference Result 2582 states and 4657 transitions. [2025-01-09 05:23:05,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:23:05,443 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-01-09 05:23:05,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:05,453 INFO L225 Difference]: With dead ends: 2582 [2025-01-09 05:23:05,453 INFO L226 Difference]: Without dead ends: 2436 [2025-01-09 05:23:05,454 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-01-09 05:23:05,455 INFO L435 NwaCegarLoop]: 4140 mSDtfsCounter, 4355 mSDsluCounter, 8361 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4366 SdHoareTripleChecker+Valid, 12501 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 05:23:05,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4366 Valid, 12501 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 05:23:05,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2025-01-09 05:23:05,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2423. [2025-01-09 05:23:05,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2423 states, 2377 states have (on average 1.8308792595708876) internal successors, (4352), 2381 states have internal predecessors, (4352), 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-01-09 05:23:05,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 4413 transitions. [2025-01-09 05:23:05,511 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 4413 transitions. Word has length 78 [2025-01-09 05:23:05,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:05,512 INFO L471 AbstractCegarLoop]: Abstraction has 2423 states and 4413 transitions. [2025-01-09 05:23:05,512 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-01-09 05:23:05,512 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 4413 transitions. [2025-01-09 05:23:05,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 05:23:05,513 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:05,513 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-01-09 05:23:05,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:23:05,514 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:05,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:05,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1686043568, now seen corresponding path program 1 times [2025-01-09 05:23:05,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:05,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493532921] [2025-01-09 05:23:05,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:05,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:05,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 05:23:05,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 05:23:05,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:05,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:05,746 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:05,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:05,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493532921] [2025-01-09 05:23:05,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493532921] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:05,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:05,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:23:05,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220253523] [2025-01-09 05:23:05,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:05,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:23:05,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:05,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:23:05,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:05,748 INFO L87 Difference]: Start difference. First operand 2423 states and 4413 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-01-09 05:23:06,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:06,181 INFO L93 Difference]: Finished difference Result 2895 states and 5134 transitions. [2025-01-09 05:23:06,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:23:06,182 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-01-09 05:23:06,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:06,194 INFO L225 Difference]: With dead ends: 2895 [2025-01-09 05:23:06,195 INFO L226 Difference]: Without dead ends: 2604 [2025-01-09 05:23:06,197 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-01-09 05:23:06,198 INFO L435 NwaCegarLoop]: 4259 mSDtfsCounter, 4346 mSDsluCounter, 12749 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4357 SdHoareTripleChecker+Valid, 17008 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-01-09 05:23:06,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4357 Valid, 17008 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:23:06,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2025-01-09 05:23:06,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 2559. [2025-01-09 05:23:06,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2559 states, 2494 states have (on average 1.8159582999198076) internal successors, (4529), 2499 states have internal predecessors, (4529), 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-01-09 05:23:06,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 4617 transitions. [2025-01-09 05:23:06,268 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 4617 transitions. Word has length 78 [2025-01-09 05:23:06,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:06,269 INFO L471 AbstractCegarLoop]: Abstraction has 2559 states and 4617 transitions. [2025-01-09 05:23:06,269 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-01-09 05:23:06,269 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 4617 transitions. [2025-01-09 05:23:06,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 05:23:06,271 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:06,271 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-01-09 05:23:06,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:23:06,272 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:06,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:06,272 INFO L85 PathProgramCache]: Analyzing trace with hash -2103440174, now seen corresponding path program 1 times [2025-01-09 05:23:06,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:06,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421414739] [2025-01-09 05:23:06,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:06,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:06,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 05:23:06,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 05:23:06,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:06,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:06,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:06,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:06,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421414739] [2025-01-09 05:23:06,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421414739] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:06,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:06,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:23:06,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920926791] [2025-01-09 05:23:06,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:06,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:23:06,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:06,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:23:06,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:06,546 INFO L87 Difference]: Start difference. First operand 2559 states and 4617 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-01-09 05:23:06,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:06,976 INFO L93 Difference]: Finished difference Result 3319 states and 5777 transitions. [2025-01-09 05:23:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:23:06,976 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-01-09 05:23:06,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:06,986 INFO L225 Difference]: With dead ends: 3319 [2025-01-09 05:23:06,986 INFO L226 Difference]: Without dead ends: 2892 [2025-01-09 05:23:06,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:23:06,989 INFO L435 NwaCegarLoop]: 4255 mSDtfsCounter, 4341 mSDsluCounter, 12737 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4352 SdHoareTripleChecker+Valid, 16992 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-01-09 05:23:06,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4352 Valid, 16992 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:23:06,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2025-01-09 05:23:07,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2844. [2025-01-09 05:23:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2844 states, 2739 states have (on average 1.7897042716319824) internal successors, (4902), 2748 states have internal predecessors, (4902), 67 states have call successors, (67), 31 states have call predecessors, (67), 36 states have return successors, (81), 68 states have call predecessors, (81), 65 states have call successors, (81) [2025-01-09 05:23:07,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 5050 transitions. [2025-01-09 05:23:07,055 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 5050 transitions. Word has length 78 [2025-01-09 05:23:07,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:07,055 INFO L471 AbstractCegarLoop]: Abstraction has 2844 states and 5050 transitions. [2025-01-09 05:23:07,055 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-01-09 05:23:07,055 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 5050 transitions. [2025-01-09 05:23:07,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 05:23:07,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:07,057 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-01-09 05:23:07,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:23:07,057 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:07,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:07,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1424167920, now seen corresponding path program 1 times [2025-01-09 05:23:07,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:07,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932411184] [2025-01-09 05:23:07,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:07,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:07,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 05:23:07,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 05:23:07,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:07,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:07,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:07,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:07,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932411184] [2025-01-09 05:23:07,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932411184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:07,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:07,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:23:07,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682340264] [2025-01-09 05:23:07,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:07,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:23:07,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:07,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:23:07,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:07,168 INFO L87 Difference]: Start difference. First operand 2844 states and 5050 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-01-09 05:23:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:07,625 INFO L93 Difference]: Finished difference Result 4214 states and 7160 transitions. [2025-01-09 05:23:07,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:23:07,626 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-01-09 05:23:07,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:07,642 INFO L225 Difference]: With dead ends: 4214 [2025-01-09 05:23:07,642 INFO L226 Difference]: Without dead ends: 3502 [2025-01-09 05:23:07,646 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-01-09 05:23:07,648 INFO L435 NwaCegarLoop]: 4252 mSDtfsCounter, 4336 mSDsluCounter, 12728 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4347 SdHoareTripleChecker+Valid, 16980 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-01-09 05:23:07,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4347 Valid, 16980 Invalid, 528 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:23:07,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3502 states. [2025-01-09 05:23:07,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3502 to 3447. [2025-01-09 05:23:07,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3447 states, 3256 states have (on average 1.7487714987714988) internal successors, (5694), 3279 states have internal predecessors, (5694), 115 states have call successors, (115), 55 states have call predecessors, (115), 74 states have return successors, (177), 120 states have call predecessors, (177), 113 states have call successors, (177) [2025-01-09 05:23:07,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 5986 transitions. [2025-01-09 05:23:07,766 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 5986 transitions. Word has length 78 [2025-01-09 05:23:07,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:07,766 INFO L471 AbstractCegarLoop]: Abstraction has 3447 states and 5986 transitions. [2025-01-09 05:23:07,767 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-01-09 05:23:07,767 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 5986 transitions. [2025-01-09 05:23:07,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 05:23:07,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:07,769 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-01-09 05:23:07,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:23:07,769 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:07,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:07,772 INFO L85 PathProgramCache]: Analyzing trace with hash 537406738, now seen corresponding path program 1 times [2025-01-09 05:23:07,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:07,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147059587] [2025-01-09 05:23:07,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:07,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:07,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 05:23:07,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 05:23:07,787 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:07,787 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:07,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:07,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:07,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147059587] [2025-01-09 05:23:07,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147059587] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:07,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:07,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:23:07,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801853686] [2025-01-09 05:23:07,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:07,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:23:07,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:07,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:23:07,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:07,906 INFO L87 Difference]: Start difference. First operand 3447 states and 5986 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-01-09 05:23:08,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:08,374 INFO L93 Difference]: Finished difference Result 6325 states and 10499 transitions. [2025-01-09 05:23:08,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:23:08,374 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-01-09 05:23:08,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:08,395 INFO L225 Difference]: With dead ends: 6325 [2025-01-09 05:23:08,395 INFO L226 Difference]: Without dead ends: 5010 [2025-01-09 05:23:08,402 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-01-09 05:23:08,402 INFO L435 NwaCegarLoop]: 4247 mSDtfsCounter, 4435 mSDsluCounter, 12708 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4450 SdHoareTripleChecker+Valid, 16955 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-01-09 05:23:08,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4450 Valid, 16955 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 05:23:08,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5010 states. [2025-01-09 05:23:08,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5010 to 4710. [2025-01-09 05:23:08,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4710 states, 4337 states have (on average 1.6984090385058797) internal successors, (7366), 4406 states have internal predecessors, (7366), 203 states have call successors, (203), 103 states have call predecessors, (203), 168 states have return successors, (457), 216 states have call predecessors, (457), 201 states have call successors, (457) [2025-01-09 05:23:08,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4710 states to 4710 states and 8026 transitions. [2025-01-09 05:23:08,573 INFO L78 Accepts]: Start accepts. Automaton has 4710 states and 8026 transitions. Word has length 78 [2025-01-09 05:23:08,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:08,573 INFO L471 AbstractCegarLoop]: Abstraction has 4710 states and 8026 transitions. [2025-01-09 05:23:08,573 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-01-09 05:23:08,574 INFO L276 IsEmpty]: Start isEmpty. Operand 4710 states and 8026 transitions. [2025-01-09 05:23:08,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 05:23:08,577 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:08,580 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-01-09 05:23:08,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:23:08,580 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:08,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:08,580 INFO L85 PathProgramCache]: Analyzing trace with hash 739230672, now seen corresponding path program 1 times [2025-01-09 05:23:08,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:08,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148122992] [2025-01-09 05:23:08,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:08,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:08,586 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 05:23:08,593 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 05:23:08,595 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:08,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:08,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:08,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:08,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148122992] [2025-01-09 05:23:08,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148122992] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:08,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:08,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:23:08,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260769623] [2025-01-09 05:23:08,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:08,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:23:08,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:08,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:23:08,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:08,686 INFO L87 Difference]: Start difference. First operand 4710 states and 8026 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-01-09 05:23:09,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:09,447 INFO L93 Difference]: Finished difference Result 10404 states and 17373 transitions. [2025-01-09 05:23:09,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:23:09,447 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-01-09 05:23:09,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:09,498 INFO L225 Difference]: With dead ends: 10404 [2025-01-09 05:23:09,498 INFO L226 Difference]: Without dead ends: 7826 [2025-01-09 05:23:09,510 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-01-09 05:23:09,512 INFO L435 NwaCegarLoop]: 4243 mSDtfsCounter, 4348 mSDsluCounter, 12696 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4358 SdHoareTripleChecker+Valid, 16939 SdHoareTripleChecker+Invalid, 607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:23:09,512 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4358 Valid, 16939 Invalid, 607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:23:09,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7826 states. [2025-01-09 05:23:09,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7826 to 7257. [2025-01-09 05:23:09,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7257 states, 6474 states have (on average 1.6419524250849553) internal successors, (10630), 6689 states have internal predecessors, (10630), 371 states have call successors, (371), 199 states have call predecessors, (371), 410 states have return successors, (1393), 400 states have call predecessors, (1393), 369 states have call successors, (1393) [2025-01-09 05:23:09,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7257 states to 7257 states and 12394 transitions. [2025-01-09 05:23:09,942 INFO L78 Accepts]: Start accepts. Automaton has 7257 states and 12394 transitions. Word has length 78 [2025-01-09 05:23:09,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:09,943 INFO L471 AbstractCegarLoop]: Abstraction has 7257 states and 12394 transitions. [2025-01-09 05:23:09,943 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-01-09 05:23:09,943 INFO L276 IsEmpty]: Start isEmpty. Operand 7257 states and 12394 transitions. [2025-01-09 05:23:09,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 05:23:09,949 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:09,950 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-01-09 05:23:09,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:23:09,950 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:09,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:09,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1299930450, now seen corresponding path program 1 times [2025-01-09 05:23:09,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:09,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354713579] [2025-01-09 05:23:09,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:09,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:09,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 05:23:09,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 05:23:09,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:09,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:10,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:10,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:10,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354713579] [2025-01-09 05:23:10,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354713579] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:10,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:10,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:23:10,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114085183] [2025-01-09 05:23:10,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:10,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:23:10,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:10,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:23:10,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:10,056 INFO L87 Difference]: Start difference. First operand 7257 states and 12394 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-01-09 05:23:10,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:10,858 INFO L93 Difference]: Finished difference Result 18073 states and 31623 transitions. [2025-01-09 05:23:10,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:23:10,859 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-01-09 05:23:10,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:10,907 INFO L225 Difference]: With dead ends: 18073 [2025-01-09 05:23:10,907 INFO L226 Difference]: Without dead ends: 12948 [2025-01-09 05:23:10,922 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-01-09 05:23:10,923 INFO L435 NwaCegarLoop]: 4237 mSDtfsCounter, 4332 mSDsluCounter, 12680 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4347 SdHoareTripleChecker+Valid, 16917 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.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:23:10,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4347 Valid, 16917 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 05:23:10,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12948 states. [2025-01-09 05:23:11,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12948 to 12609. [2025-01-09 05:23:11,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12609 states, 10860 states have (on average 1.5856353591160222) internal successors, (17220), 11529 states have internal predecessors, (17220), 691 states have call successors, (691), 391 states have call predecessors, (691), 1056 states have return successors, (4785), 752 states have call predecessors, (4785), 689 states have call successors, (4785) [2025-01-09 05:23:11,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12609 states to 12609 states and 22696 transitions. [2025-01-09 05:23:11,489 INFO L78 Accepts]: Start accepts. Automaton has 12609 states and 22696 transitions. Word has length 78 [2025-01-09 05:23:11,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:11,490 INFO L471 AbstractCegarLoop]: Abstraction has 12609 states and 22696 transitions. [2025-01-09 05:23:11,491 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-01-09 05:23:11,491 INFO L276 IsEmpty]: Start isEmpty. Operand 12609 states and 22696 transitions. [2025-01-09 05:23:11,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 05:23:11,500 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:11,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-01-09 05:23:11,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:23:11,500 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:11,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:11,501 INFO L85 PathProgramCache]: Analyzing trace with hash -1734119596, now seen corresponding path program 1 times [2025-01-09 05:23:11,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:11,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421567047] [2025-01-09 05:23:11,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:11,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:11,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 05:23:11,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 05:23:11,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:11,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:11,561 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 05:23:11,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:11,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421567047] [2025-01-09 05:23:11,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421567047] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:11,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:23:11,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:23:11,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847021248] [2025-01-09 05:23:11,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:11,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:23:11,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:11,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:23:11,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:23:11,564 INFO L87 Difference]: Start difference. First operand 12609 states and 22696 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-01-09 05:23:12,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:12,262 INFO L93 Difference]: Finished difference Result 28667 states and 51499 transitions. [2025-01-09 05:23:12,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:23:12,262 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-01-09 05:23:12,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:12,333 INFO L225 Difference]: With dead ends: 28667 [2025-01-09 05:23:12,333 INFO L226 Difference]: Without dead ends: 18191 [2025-01-09 05:23:12,372 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-01-09 05:23:12,373 INFO L435 NwaCegarLoop]: 4378 mSDtfsCounter, 4345 mSDsluCounter, 4313 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4345 SdHoareTripleChecker+Valid, 8691 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-01-09 05:23:12,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4345 Valid, 8691 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 05:23:12,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18191 states. [2025-01-09 05:23:13,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18191 to 17348. [2025-01-09 05:23:13,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17348 states, 14824 states have (on average 1.5496492174851593) internal successors, (22972), 15738 states have internal predecessors, (22972), 1056 states have call successors, (1056), 589 states have call predecessors, (1056), 1466 states have return successors, (6143), 1084 states have call predecessors, (6143), 1054 states have call successors, (6143) [2025-01-09 05:23:13,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17348 states to 17348 states and 30171 transitions. [2025-01-09 05:23:13,673 INFO L78 Accepts]: Start accepts. Automaton has 17348 states and 30171 transitions. Word has length 78 [2025-01-09 05:23:13,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:13,674 INFO L471 AbstractCegarLoop]: Abstraction has 17348 states and 30171 transitions. [2025-01-09 05:23:13,674 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-01-09 05:23:13,674 INFO L276 IsEmpty]: Start isEmpty. Operand 17348 states and 30171 transitions. [2025-01-09 05:23:13,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 05:23:13,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:13,784 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-01-09 05:23:13,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:23:13,784 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:13,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:13,788 INFO L85 PathProgramCache]: Analyzing trace with hash -665744423, now seen corresponding path program 1 times [2025-01-09 05:23:13,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:13,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509768442] [2025-01-09 05:23:13,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:13,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:13,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 05:23:13,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 05:23:13,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:13,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:13,857 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 05:23:13,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:13,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509768442] [2025-01-09 05:23:13,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509768442] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:23:13,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467499519] [2025-01-09 05:23:13,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:13,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:23:13,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:23:13,861 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:23:13,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 05:23:13,913 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 05:23:13,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 05:23:13,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:13,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:13,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:23:13,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:23:14,013 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 05:23:14,013 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:23:14,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467499519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:14,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:23:14,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 05:23:14,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355389662] [2025-01-09 05:23:14,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:14,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:23:14,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:14,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:23:14,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:14,015 INFO L87 Difference]: Start difference. First operand 17348 states and 30171 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-01-09 05:23:15,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:15,451 INFO L93 Difference]: Finished difference Result 47431 states and 82415 transitions. [2025-01-09 05:23:15,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:23:15,452 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-01-09 05:23:15,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:15,617 INFO L225 Difference]: With dead ends: 47431 [2025-01-09 05:23:15,618 INFO L226 Difference]: Without dead ends: 32216 [2025-01-09 05:23:15,680 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-01-09 05:23:15,681 INFO L435 NwaCegarLoop]: 4188 mSDtfsCounter, 4144 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4144 SdHoareTripleChecker+Valid, 4395 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-01-09 05:23:15,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4144 Valid, 4395 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:23:15,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32216 states. [2025-01-09 05:23:17,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32216 to 32114. [2025-01-09 05:23:17,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32114 states, 27124 states have (on average 1.5220837634567173) internal successors, (41285), 28949 states have internal predecessors, (41285), 2056 states have call successors, (2056), 1177 states have call predecessors, (2056), 2932 states have return successors, (12169), 2051 states have call predecessors, (12169), 2054 states have call successors, (12169) [2025-01-09 05:23:17,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32114 states to 32114 states and 55510 transitions. [2025-01-09 05:23:17,466 INFO L78 Accepts]: Start accepts. Automaton has 32114 states and 55510 transitions. Word has length 126 [2025-01-09 05:23:17,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:17,467 INFO L471 AbstractCegarLoop]: Abstraction has 32114 states and 55510 transitions. [2025-01-09 05:23:17,467 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-01-09 05:23:17,467 INFO L276 IsEmpty]: Start isEmpty. Operand 32114 states and 55510 transitions. [2025-01-09 05:23:17,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 05:23:17,529 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:17,529 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-01-09 05:23:17,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 05:23:17,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 05:23:17,734 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:17,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:17,735 INFO L85 PathProgramCache]: Analyzing trace with hash -1228366697, now seen corresponding path program 1 times [2025-01-09 05:23:17,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:17,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56958868] [2025-01-09 05:23:17,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:17,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:17,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 05:23:17,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 05:23:17,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:17,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:17,790 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 05:23:17,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:17,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56958868] [2025-01-09 05:23:17,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56958868] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:23:17,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417868981] [2025-01-09 05:23:17,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:17,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:23:17,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:23:17,799 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:23:17,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 05:23:17,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 05:23:17,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 05:23:17,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:17,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:17,887 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:23:17,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:23:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 05:23:17,946 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:23:17,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417868981] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:17,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:23:17,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 05:23:17,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87035454] [2025-01-09 05:23:17,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:17,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:23:17,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:17,946 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:23:17,947 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:17,947 INFO L87 Difference]: Start difference. First operand 32114 states and 55510 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-01-09 05:23:20,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:20,577 INFO L93 Difference]: Finished difference Result 91383 states and 158300 transitions. [2025-01-09 05:23:20,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:23:20,577 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-01-09 05:23:20,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:20,941 INFO L225 Difference]: With dead ends: 91383 [2025-01-09 05:23:20,941 INFO L226 Difference]: Without dead ends: 61402 [2025-01-09 05:23:21,047 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-01-09 05:23:21,048 INFO L435 NwaCegarLoop]: 4188 mSDtfsCounter, 4138 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4138 SdHoareTripleChecker+Valid, 4395 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-01-09 05:23:21,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4138 Valid, 4395 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:23:21,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61402 states. [2025-01-09 05:23:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61402 to 61202. [2025-01-09 05:23:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61202 states, 51330 states have (on average 1.5044418468731735) internal successors, (77223), 54977 states have internal predecessors, (77223), 4006 states have call successors, (4006), 2353 states have call predecessors, (4006), 5864 states have return successors, (24171), 3935 states have call predecessors, (24171), 4004 states have call successors, (24171) [2025-01-09 05:23:24,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61202 states to 61202 states and 105400 transitions. [2025-01-09 05:23:24,686 INFO L78 Accepts]: Start accepts. Automaton has 61202 states and 105400 transitions. Word has length 126 [2025-01-09 05:23:24,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:24,687 INFO L471 AbstractCegarLoop]: Abstraction has 61202 states and 105400 transitions. [2025-01-09 05:23:24,687 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-01-09 05:23:24,687 INFO L276 IsEmpty]: Start isEmpty. Operand 61202 states and 105400 transitions. [2025-01-09 05:23:24,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 05:23:24,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:24,770 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-01-09 05:23:24,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 05:23:24,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:23:24,971 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:24,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:24,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1024627669, now seen corresponding path program 1 times [2025-01-09 05:23:24,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:24,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344450602] [2025-01-09 05:23:24,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:24,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:24,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 05:23:24,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 05:23:24,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:24,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:25,050 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 05:23:25,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:25,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344450602] [2025-01-09 05:23:25,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344450602] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:23:25,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [231448483] [2025-01-09 05:23:25,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:25,052 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:23:25,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:23:25,055 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:23:25,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 05:23:25,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 05:23:25,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 05:23:25,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:25,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:25,161 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:23:25,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:23:25,192 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 05:23:25,193 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:23:25,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [231448483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:25,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:23:25,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 05:23:25,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220296448] [2025-01-09 05:23:25,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:25,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:23:25,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:25,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:23:25,194 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:25,195 INFO L87 Difference]: Start difference. First operand 61202 states and 105400 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-01-09 05:23:27,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:23:27,880 INFO L93 Difference]: Finished difference Result 99098 states and 167215 transitions. [2025-01-09 05:23:27,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:23:27,881 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-01-09 05:23:27,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:23:28,331 INFO L225 Difference]: With dead ends: 99098 [2025-01-09 05:23:28,331 INFO L226 Difference]: Without dead ends: 79290 [2025-01-09 05:23:28,418 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-01-09 05:23:28,419 INFO L435 NwaCegarLoop]: 4378 mSDtfsCounter, 179 mSDsluCounter, 4188 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 8566 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:23:28,420 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 8566 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:23:28,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79290 states. [2025-01-09 05:23:31,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79290 to 79290. [2025-01-09 05:23:31,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79290 states, 66518 states have (on average 1.4966625575032322) internal successors, (99555), 71013 states have internal predecessors, (99555), 5266 states have call successors, (5266), 3145 states have call predecessors, (5266), 7504 states have return successors, (29871), 5195 states have call predecessors, (29871), 5264 states have call successors, (29871) [2025-01-09 05:23:31,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79290 states to 79290 states and 134692 transitions. [2025-01-09 05:23:32,002 INFO L78 Accepts]: Start accepts. Automaton has 79290 states and 134692 transitions. Word has length 126 [2025-01-09 05:23:32,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:23:32,003 INFO L471 AbstractCegarLoop]: Abstraction has 79290 states and 134692 transitions. [2025-01-09 05:23:32,003 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-01-09 05:23:32,003 INFO L276 IsEmpty]: Start isEmpty. Operand 79290 states and 134692 transitions. [2025-01-09 05:23:32,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 05:23:32,205 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:23:32,205 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:23:32,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 05:23:32,410 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:23:32,410 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:23:32,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:23:32,410 INFO L85 PathProgramCache]: Analyzing trace with hash 260587635, now seen corresponding path program 1 times [2025-01-09 05:23:32,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:23:32,410 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022412868] [2025-01-09 05:23:32,411 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:32,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:23:32,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 05:23:32,446 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 05:23:32,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:32,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:32,537 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 05:23:32,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:23:32,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022412868] [2025-01-09 05:23:32,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022412868] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:23:32,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949187184] [2025-01-09 05:23:32,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:23:32,538 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:23:32,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:23:32,542 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:23:32,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 05:23:32,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 05:23:32,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 05:23:32,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:23:32,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:23:32,661 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:23:32,664 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:23:32,803 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 05:23:32,804 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:23:32,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1949187184] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:23:32,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:23:32,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 05:23:32,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812328406] [2025-01-09 05:23:32,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:23:32,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:23:32,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:23:32,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:23:32,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:23:32,807 INFO L87 Difference]: Start difference. First operand 79290 states and 134692 transitions. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 2 states have internal predecessors, (118), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10)