./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/Problem05_label45+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_label45+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 7ec37a095871269c822e7d35e6d840f2de134a68f657807281a5c0e96980df26 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:20:55,397 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:20:55,465 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:20:55,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:20:55,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:20:55,483 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:20:55,484 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:20:55,484 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:20:55,484 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:20:55,484 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:20:55,484 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:20:55,484 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:20:55,485 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:20:55,485 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:20:55,485 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:20:55,485 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:20:55,485 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:20:55,485 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:20:55,485 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:20:55,485 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:20:55,485 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:20:55,485 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:20:55,486 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:20:55,486 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:20:55,486 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:20:55,486 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:20:55,486 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:20:55,486 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:20:55,486 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:20:55,486 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:20:55,486 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:20:55,486 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:20:55,486 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:20:55,487 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:20:55,487 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:20:55,487 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:20:55,487 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:20:55,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:20:55,487 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:20:55,487 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:20:55,487 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:20:55,487 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:20:55,487 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:20:55,487 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:20:55,487 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:20:55,487 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:20:55,487 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:20:55,488 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:20:55,488 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 -> 7ec37a095871269c822e7d35e6d840f2de134a68f657807281a5c0e96980df26 [2025-01-09 05:20:55,705 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:20:55,714 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:20:55,716 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:20:55,717 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:20:55,717 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:20:55,718 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-1.c [2025-01-09 05:20:56,912 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e755dfc75/81cbd72ca54f477bba1f7d97b5ed4c29/FLAGbe515275c [2025-01-09 05:20:57,585 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:20:57,586 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-1.c [2025-01-09 05:20:57,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e755dfc75/81cbd72ca54f477bba1f7d97b5ed4c29/FLAGbe515275c [2025-01-09 05:20:57,999 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e755dfc75/81cbd72ca54f477bba1f7d97b5ed4c29 [2025-01-09 05:20:58,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:20:58,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:20:58,003 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:20:58,003 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:20:58,006 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:20:58,007 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:20:58" (1/1) ... [2025-01-09 05:20:58,008 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7826c68c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:20:58, skipping insertion in model container [2025-01-09 05:20:58,008 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:20:58" (1/1) ... [2025-01-09 05:20:58,173 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:20:59,403 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-1.c[380323,380336] [2025-01-09 05:20:59,431 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-1.c[383339,383352] [2025-01-09 05:20:59,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:20:59,588 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:21:00,117 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-1.c[380323,380336] [2025-01-09 05:21:00,123 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/combinations/Problem05_label45+token_ring.03.cil-1.c[383339,383352] [2025-01-09 05:21:00,138 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:21:00,186 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:21:00,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:00 WrapperNode [2025-01-09 05:21:00,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:21:00,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:21:00,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:21:00,189 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:21:00,195 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:21:00" (1/1) ... [2025-01-09 05:21:00,288 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:21:00" (1/1) ... [2025-01-09 05:21:00,604 INFO L138 Inliner]: procedures = 50, calls = 51, calls flagged for inlining = 27, calls inlined = 27, statements flattened = 12678 [2025-01-09 05:21:00,604 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:21:00,605 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:21:00,605 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:21:00,605 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:21:00,612 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:00" (1/1) ... [2025-01-09 05:21:00,612 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:00" (1/1) ... [2025-01-09 05:21:00,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:00" (1/1) ... [2025-01-09 05:21:00,824 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:21:00,825 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:00" (1/1) ... [2025-01-09 05:21:00,825 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:00" (1/1) ... [2025-01-09 05:21:01,116 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:00" (1/1) ... [2025-01-09 05:21:01,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:00" (1/1) ... [2025-01-09 05:21:01,183 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:00" (1/1) ... [2025-01-09 05:21:01,208 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:00" (1/1) ... [2025-01-09 05:21:01,228 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:00" (1/1) ... [2025-01-09 05:21:01,268 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:21:01,270 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:21:01,270 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:21:01,270 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:21:01,271 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:00" (1/1) ... [2025-01-09 05:21:01,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:21:01,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:21:01,312 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:21:01,324 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:21:01,417 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:21:01,420 INFO L130 BoogieDeclarations]: Found specification of procedure activate_threads [2025-01-09 05:21:01,421 INFO L138 BoogieDeclarations]: Found implementation of procedure activate_threads [2025-01-09 05:21:01,421 INFO L130 BoogieDeclarations]: Found specification of procedure immediate_notify [2025-01-09 05:21:01,421 INFO L138 BoogieDeclarations]: Found implementation of procedure immediate_notify [2025-01-09 05:21:01,421 INFO L130 BoogieDeclarations]: Found specification of procedure update_channels [2025-01-09 05:21:01,421 INFO L138 BoogieDeclarations]: Found implementation of procedure update_channels [2025-01-09 05:21:01,421 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 05:21:01,421 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 05:21:01,421 INFO L130 BoogieDeclarations]: Found specification of procedure fire_delta_events [2025-01-09 05:21:01,421 INFO L138 BoogieDeclarations]: Found implementation of procedure fire_delta_events [2025-01-09 05:21:01,421 INFO L130 BoogieDeclarations]: Found specification of procedure exists_runnable_thread [2025-01-09 05:21:01,421 INFO L138 BoogieDeclarations]: Found implementation of procedure exists_runnable_thread [2025-01-09 05:21:01,421 INFO L130 BoogieDeclarations]: Found specification of procedure reset_delta_events [2025-01-09 05:21:01,421 INFO L138 BoogieDeclarations]: Found implementation of procedure reset_delta_events [2025-01-09 05:21:01,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:21:01,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:21:01,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:21:01,590 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:21:01,592 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:21:07,693 INFO L? ?]: Removed 1705 outVars from TransFormulas that were not future-live. [2025-01-09 05:21:07,693 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:21:07,749 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:21:07,753 INFO L312 CfgBuilder]: Removed 7 assume(true) statements. [2025-01-09 05:21:07,753 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:21:07 BoogieIcfgContainer [2025-01-09 05:21:07,754 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:21:07,755 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:21:07,756 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:21:07,760 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:21:07,760 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:20:58" (1/3) ... [2025-01-09 05:21:07,761 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6159bdc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:21:07, skipping insertion in model container [2025-01-09 05:21:07,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:21:00" (2/3) ... [2025-01-09 05:21:07,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6159bdc7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:21:07, skipping insertion in model container [2025-01-09 05:21:07,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:21:07" (3/3) ... [2025-01-09 05:21:07,764 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem05_label45+token_ring.03.cil-1.c [2025-01-09 05:21:07,775 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:21:07,778 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem05_label45+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:21:07,881 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:21:07,903 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;@20c774bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:21:07,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-01-09 05:21:07,920 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:21:07,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 05:21:07,931 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:07,931 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:21:07,932 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:07,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:07,937 INFO L85 PathProgramCache]: Analyzing trace with hash 214767506, now seen corresponding path program 1 times [2025-01-09 05:21:07,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:07,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600388196] [2025-01-09 05:21:07,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:07,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:08,016 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 05:21:08,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 05:21:08,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:08,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:08,147 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:21:08,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:08,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600388196] [2025-01-09 05:21:08,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600388196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:08,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:21:08,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:21:08,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255158558] [2025-01-09 05:21:08,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:08,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:21:08,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:08,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:21:08,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:21:08,179 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:21:08,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:08,400 INFO L93 Difference]: Finished difference Result 4686 states and 8657 transitions. [2025-01-09 05:21:08,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:21:08,406 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:21:08,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:08,439 INFO L225 Difference]: With dead ends: 4686 [2025-01-09 05:21:08,439 INFO L226 Difference]: Without dead ends: 2278 [2025-01-09 05:21:08,449 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:21:08,452 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.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:21:08,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 8283 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:21:08,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2278 states. [2025-01-09 05:21:08,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2278 to 2278. [2025-01-09 05:21:08,562 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:21:08,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2278 states to 2278 states and 4193 transitions. [2025-01-09 05:21:08,584 INFO L78 Accepts]: Start accepts. Automaton has 2278 states and 4193 transitions. Word has length 78 [2025-01-09 05:21:08,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:21:08,585 INFO L471 AbstractCegarLoop]: Abstraction has 2278 states and 4193 transitions. [2025-01-09 05:21:08,585 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:21:08,585 INFO L276 IsEmpty]: Start isEmpty. Operand 2278 states and 4193 transitions. [2025-01-09 05:21:08,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 05:21:08,587 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:08,587 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:21:08,588 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:21:08,588 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:08,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:08,589 INFO L85 PathProgramCache]: Analyzing trace with hash -1693690284, now seen corresponding path program 1 times [2025-01-09 05:21:08,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:08,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81622922] [2025-01-09 05:21:08,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:08,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:08,599 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 05:21:08,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 05:21:08,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:08,619 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:08,885 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:21:08,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:08,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81622922] [2025-01-09 05:21:08,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81622922] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:08,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:21:08,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:21:08,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610031857] [2025-01-09 05:21:08,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:08,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:21:08,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:08,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:21:08,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:21:08,887 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:21:09,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:09,325 INFO L93 Difference]: Finished difference Result 2582 states and 4657 transitions. [2025-01-09 05:21:09,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:21:09,326 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:21:09,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:09,336 INFO L225 Difference]: With dead ends: 2582 [2025-01-09 05:21:09,336 INFO L226 Difference]: Without dead ends: 2436 [2025-01-09 05:21:09,337 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:21:09,338 INFO L435 NwaCegarLoop]: 4140 mSDtfsCounter, 4355 mSDsluCounter, 8361 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:21:09,338 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.3s Time] [2025-01-09 05:21:09,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2436 states. [2025-01-09 05:21:09,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2436 to 2423. [2025-01-09 05:21:09,373 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:21:09,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2423 states to 2423 states and 4413 transitions. [2025-01-09 05:21:09,381 INFO L78 Accepts]: Start accepts. Automaton has 2423 states and 4413 transitions. Word has length 78 [2025-01-09 05:21:09,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:21:09,381 INFO L471 AbstractCegarLoop]: Abstraction has 2423 states and 4413 transitions. [2025-01-09 05:21:09,381 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:21:09,381 INFO L276 IsEmpty]: Start isEmpty. Operand 2423 states and 4413 transitions. [2025-01-09 05:21:09,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 05:21:09,383 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:09,383 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:21:09,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:21:09,383 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:09,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:09,384 INFO L85 PathProgramCache]: Analyzing trace with hash -1686043568, now seen corresponding path program 1 times [2025-01-09 05:21:09,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:09,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145916294] [2025-01-09 05:21:09,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:09,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:09,391 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 05:21:09,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 05:21:09,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:09,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:09,552 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:21:09,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:09,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145916294] [2025-01-09 05:21:09,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145916294] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:09,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:21:09,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:21:09,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330381983] [2025-01-09 05:21:09,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:09,553 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:21:09,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:09,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:21:09,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:21:09,554 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:21:10,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:10,006 INFO L93 Difference]: Finished difference Result 2895 states and 5134 transitions. [2025-01-09 05:21:10,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:21:10,007 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:21:10,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:10,019 INFO L225 Difference]: With dead ends: 2895 [2025-01-09 05:21:10,019 INFO L226 Difference]: Without dead ends: 2604 [2025-01-09 05:21:10,022 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:21:10,024 INFO L435 NwaCegarLoop]: 4259 mSDtfsCounter, 4346 mSDsluCounter, 12749 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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:21:10,025 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:21:10,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2604 states. [2025-01-09 05:21:10,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2604 to 2559. [2025-01-09 05:21:10,075 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:21:10,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2559 states to 2559 states and 4617 transitions. [2025-01-09 05:21:10,087 INFO L78 Accepts]: Start accepts. Automaton has 2559 states and 4617 transitions. Word has length 78 [2025-01-09 05:21:10,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:21:10,088 INFO L471 AbstractCegarLoop]: Abstraction has 2559 states and 4617 transitions. [2025-01-09 05:21:10,088 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:21:10,088 INFO L276 IsEmpty]: Start isEmpty. Operand 2559 states and 4617 transitions. [2025-01-09 05:21:10,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 05:21:10,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:10,090 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:21:10,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 05:21:10,090 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:10,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:10,091 INFO L85 PathProgramCache]: Analyzing trace with hash -2103440174, now seen corresponding path program 1 times [2025-01-09 05:21:10,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:10,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133123240] [2025-01-09 05:21:10,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:10,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:10,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 05:21:10,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 05:21:10,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:10,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:10,230 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:21:10,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:10,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133123240] [2025-01-09 05:21:10,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133123240] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:10,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:21:10,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:21:10,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463226466] [2025-01-09 05:21:10,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:10,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:21:10,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:10,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:21:10,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:21:10,232 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:21:10,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:10,606 INFO L93 Difference]: Finished difference Result 3319 states and 5777 transitions. [2025-01-09 05:21:10,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:21:10,607 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:21:10,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:10,618 INFO L225 Difference]: With dead ends: 3319 [2025-01-09 05:21:10,618 INFO L226 Difference]: Without dead ends: 2892 [2025-01-09 05:21:10,620 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:21:10,621 INFO L435 NwaCegarLoop]: 4255 mSDtfsCounter, 4341 mSDsluCounter, 12737 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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:21:10,621 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:21:10,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2892 states. [2025-01-09 05:21:10,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2892 to 2844. [2025-01-09 05:21:10,678 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:21:10,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2844 states to 2844 states and 5050 transitions. [2025-01-09 05:21:10,691 INFO L78 Accepts]: Start accepts. Automaton has 2844 states and 5050 transitions. Word has length 78 [2025-01-09 05:21:10,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:21:10,691 INFO L471 AbstractCegarLoop]: Abstraction has 2844 states and 5050 transitions. [2025-01-09 05:21:10,691 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:21:10,691 INFO L276 IsEmpty]: Start isEmpty. Operand 2844 states and 5050 transitions. [2025-01-09 05:21:10,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 05:21:10,692 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:10,692 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:21:10,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:21:10,693 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:10,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:10,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1424167920, now seen corresponding path program 1 times [2025-01-09 05:21:10,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:10,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167420065] [2025-01-09 05:21:10,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:10,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:10,703 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 05:21:10,706 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 05:21:10,709 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:10,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:10,858 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:21:10,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:10,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167420065] [2025-01-09 05:21:10,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [167420065] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:10,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:21:10,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:21:10,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304293193] [2025-01-09 05:21:10,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:10,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:21:10,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:10,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:21:10,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:21:10,860 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:21:11,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:11,234 INFO L93 Difference]: Finished difference Result 4214 states and 7160 transitions. [2025-01-09 05:21:11,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:21:11,235 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:21:11,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:11,249 INFO L225 Difference]: With dead ends: 4214 [2025-01-09 05:21:11,249 INFO L226 Difference]: Without dead ends: 3502 [2025-01-09 05:21:11,253 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:21:11,253 INFO L435 NwaCegarLoop]: 4252 mSDtfsCounter, 4336 mSDsluCounter, 12728 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4347 SdHoareTripleChecker+Valid, 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:21:11,253 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:21:11,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3502 states. [2025-01-09 05:21:11,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3502 to 3447. [2025-01-09 05:21:11,385 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:21:11,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3447 states to 3447 states and 5986 transitions. [2025-01-09 05:21:11,415 INFO L78 Accepts]: Start accepts. Automaton has 3447 states and 5986 transitions. Word has length 78 [2025-01-09 05:21:11,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:21:11,419 INFO L471 AbstractCegarLoop]: Abstraction has 3447 states and 5986 transitions. [2025-01-09 05:21:11,419 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:21:11,419 INFO L276 IsEmpty]: Start isEmpty. Operand 3447 states and 5986 transitions. [2025-01-09 05:21:11,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 05:21:11,421 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:11,421 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:21:11,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 05:21:11,421 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:11,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:11,425 INFO L85 PathProgramCache]: Analyzing trace with hash 537406738, now seen corresponding path program 1 times [2025-01-09 05:21:11,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:11,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613819062] [2025-01-09 05:21:11,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:11,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:11,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 05:21:11,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 05:21:11,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:11,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:11,590 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:21:11,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:11,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613819062] [2025-01-09 05:21:11,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613819062] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:11,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:21:11,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:21:11,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499630081] [2025-01-09 05:21:11,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:11,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:21:11,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:11,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:21:11,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:21:11,595 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:21:12,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:12,057 INFO L93 Difference]: Finished difference Result 6325 states and 10499 transitions. [2025-01-09 05:21:12,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:21:12,058 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:21:12,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:12,078 INFO L225 Difference]: With dead ends: 6325 [2025-01-09 05:21:12,079 INFO L226 Difference]: Without dead ends: 5010 [2025-01-09 05:21:12,084 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:21:12,085 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:21:12,085 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:21:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5010 states. [2025-01-09 05:21:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5010 to 4710. [2025-01-09 05:21:12,350 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:21:12,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4710 states to 4710 states and 8026 transitions. [2025-01-09 05:21:12,364 INFO L78 Accepts]: Start accepts. Automaton has 4710 states and 8026 transitions. Word has length 78 [2025-01-09 05:21:12,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:21:12,364 INFO L471 AbstractCegarLoop]: Abstraction has 4710 states and 8026 transitions. [2025-01-09 05:21:12,364 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:21:12,364 INFO L276 IsEmpty]: Start isEmpty. Operand 4710 states and 8026 transitions. [2025-01-09 05:21:12,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 05:21:12,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:12,367 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:21:12,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:21:12,368 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:12,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:12,368 INFO L85 PathProgramCache]: Analyzing trace with hash 739230672, now seen corresponding path program 1 times [2025-01-09 05:21:12,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:12,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712884525] [2025-01-09 05:21:12,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:12,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:12,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 05:21:12,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 05:21:12,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:12,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:12,462 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:21:12,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:12,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712884525] [2025-01-09 05:21:12,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712884525] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:12,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:21:12,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:21:12,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823635730] [2025-01-09 05:21:12,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:12,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:21:12,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:12,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:21:12,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:21:12,463 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:21:12,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:12,969 INFO L93 Difference]: Finished difference Result 10404 states and 17373 transitions. [2025-01-09 05:21:12,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:21:12,969 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:21:12,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:13,010 INFO L225 Difference]: With dead ends: 10404 [2025-01-09 05:21:13,010 INFO L226 Difference]: Without dead ends: 7826 [2025-01-09 05:21:13,021 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:21:13,021 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.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:21:13,021 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.3s Time] [2025-01-09 05:21:13,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7826 states. [2025-01-09 05:21:13,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7826 to 7257. [2025-01-09 05:21:13,546 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:21:13,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7257 states to 7257 states and 12394 transitions. [2025-01-09 05:21:13,598 INFO L78 Accepts]: Start accepts. Automaton has 7257 states and 12394 transitions. Word has length 78 [2025-01-09 05:21:13,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:21:13,599 INFO L471 AbstractCegarLoop]: Abstraction has 7257 states and 12394 transitions. [2025-01-09 05:21:13,599 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:21:13,599 INFO L276 IsEmpty]: Start isEmpty. Operand 7257 states and 12394 transitions. [2025-01-09 05:21:13,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 05:21:13,611 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:13,611 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:21:13,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:21:13,611 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:13,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:13,612 INFO L85 PathProgramCache]: Analyzing trace with hash 1299930450, now seen corresponding path program 1 times [2025-01-09 05:21:13,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:13,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897462940] [2025-01-09 05:21:13,612 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:13,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:13,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 05:21:13,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 05:21:13,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:13,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:13,707 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:21:13,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:13,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897462940] [2025-01-09 05:21:13,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897462940] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:13,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:21:13,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 05:21:13,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248464668] [2025-01-09 05:21:13,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:13,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:21:13,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:13,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:21:13,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:21:13,709 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:21:14,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:14,462 INFO L93 Difference]: Finished difference Result 18073 states and 31623 transitions. [2025-01-09 05:21:14,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 05:21:14,463 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:21:14,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:14,524 INFO L225 Difference]: With dead ends: 18073 [2025-01-09 05:21:14,524 INFO L226 Difference]: Without dead ends: 12948 [2025-01-09 05:21:14,543 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:21:14,544 INFO L435 NwaCegarLoop]: 4237 mSDtfsCounter, 4332 mSDsluCounter, 12680 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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:21:14,544 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:21:14,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12948 states. [2025-01-09 05:21:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12948 to 12609. [2025-01-09 05:21:15,361 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:21:15,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12609 states to 12609 states and 22696 transitions. [2025-01-09 05:21:15,435 INFO L78 Accepts]: Start accepts. Automaton has 12609 states and 22696 transitions. Word has length 78 [2025-01-09 05:21:15,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:21:15,435 INFO L471 AbstractCegarLoop]: Abstraction has 12609 states and 22696 transitions. [2025-01-09 05:21:15,436 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:21:15,436 INFO L276 IsEmpty]: Start isEmpty. Operand 12609 states and 22696 transitions. [2025-01-09 05:21:15,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-01-09 05:21:15,455 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:15,455 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:21:15,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:21:15,455 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:15,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:15,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1734119596, now seen corresponding path program 1 times [2025-01-09 05:21:15,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:15,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859827838] [2025-01-09 05:21:15,459 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:15,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:15,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-01-09 05:21:15,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-01-09 05:21:15,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:15,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:15,558 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:21:15,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:15,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859827838] [2025-01-09 05:21:15,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859827838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:15,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:21:15,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:21:15,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836719218] [2025-01-09 05:21:15,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:15,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:21:15,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:15,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:21:15,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:21:15,561 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:21:16,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:16,141 INFO L93 Difference]: Finished difference Result 28667 states and 51499 transitions. [2025-01-09 05:21:16,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:21:16,141 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:21:16,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:16,210 INFO L225 Difference]: With dead ends: 28667 [2025-01-09 05:21:16,210 INFO L226 Difference]: Without dead ends: 18191 [2025-01-09 05:21:16,364 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:21:16,367 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:21:16,367 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:21:16,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18191 states. [2025-01-09 05:21:17,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18191 to 17348. [2025-01-09 05:21:17,309 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:21:17,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17348 states to 17348 states and 30171 transitions. [2025-01-09 05:21:17,391 INFO L78 Accepts]: Start accepts. Automaton has 17348 states and 30171 transitions. Word has length 78 [2025-01-09 05:21:17,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:21:17,391 INFO L471 AbstractCegarLoop]: Abstraction has 17348 states and 30171 transitions. [2025-01-09 05:21:17,392 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:21:17,392 INFO L276 IsEmpty]: Start isEmpty. Operand 17348 states and 30171 transitions. [2025-01-09 05:21:17,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 05:21:17,438 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:17,438 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:21:17,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 05:21:17,439 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:17,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:17,439 INFO L85 PathProgramCache]: Analyzing trace with hash -665744423, now seen corresponding path program 1 times [2025-01-09 05:21:17,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:17,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901299623] [2025-01-09 05:21:17,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:17,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:17,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 05:21:17,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 05:21:17,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:17,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:17,548 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:21:17,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:17,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901299623] [2025-01-09 05:21:17,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901299623] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:21:17,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847132395] [2025-01-09 05:21:17,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:17,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:21:17,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:21:17,551 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:21:17,553 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:21:17,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 05:21:17,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 05:21:17,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:17,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:17,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 490 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:21:17,654 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:21:17,730 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:21:17,730 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:21:17,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847132395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:17,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:21:17,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 05:21:17,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314252729] [2025-01-09 05:21:17,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:17,731 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:21:17,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:17,732 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:21:17,732 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:21:17,732 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:21:19,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:19,049 INFO L93 Difference]: Finished difference Result 47431 states and 82415 transitions. [2025-01-09 05:21:19,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:21:19,049 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:21:19,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:19,211 INFO L225 Difference]: With dead ends: 47431 [2025-01-09 05:21:19,212 INFO L226 Difference]: Without dead ends: 32216 [2025-01-09 05:21:19,267 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:21:19,267 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:21:19,268 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:21:19,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32216 states. [2025-01-09 05:21:20,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32216 to 32114. [2025-01-09 05:21:20,976 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:21:21,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32114 states to 32114 states and 55510 transitions. [2025-01-09 05:21:21,098 INFO L78 Accepts]: Start accepts. Automaton has 32114 states and 55510 transitions. Word has length 126 [2025-01-09 05:21:21,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:21:21,098 INFO L471 AbstractCegarLoop]: Abstraction has 32114 states and 55510 transitions. [2025-01-09 05:21:21,099 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:21:21,099 INFO L276 IsEmpty]: Start isEmpty. Operand 32114 states and 55510 transitions. [2025-01-09 05:21:21,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 05:21:21,169 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:21,170 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:21:21,179 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:21:21,374 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:21:21,374 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:21,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:21,376 INFO L85 PathProgramCache]: Analyzing trace with hash -1228366697, now seen corresponding path program 1 times [2025-01-09 05:21:21,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:21,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80713545] [2025-01-09 05:21:21,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:21,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:21,382 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 05:21:21,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 05:21:21,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:21,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:21,441 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:21:21,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:21,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80713545] [2025-01-09 05:21:21,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80713545] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:21:21,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178549177] [2025-01-09 05:21:21,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:21,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:21:21,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:21:21,444 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:21:21,446 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:21:21,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 05:21:21,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 05:21:21,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:21,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:21,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:21:21,548 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:21:21,605 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:21:21,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:21:21,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178549177] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:21,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:21:21,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 05:21:21,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542311558] [2025-01-09 05:21:21,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:21,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:21:21,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:21,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:21:21,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:21:21,609 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:21:24,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:24,459 INFO L93 Difference]: Finished difference Result 91383 states and 158300 transitions. [2025-01-09 05:21:24,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:21:24,459 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:21:24,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:24,785 INFO L225 Difference]: With dead ends: 91383 [2025-01-09 05:21:24,785 INFO L226 Difference]: Without dead ends: 61402 [2025-01-09 05:21:24,893 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:21:24,894 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:21:24,894 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:21:24,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61402 states. [2025-01-09 05:21:27,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61402 to 61202. [2025-01-09 05:21:28,054 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:21:28,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61202 states to 61202 states and 105400 transitions. [2025-01-09 05:21:28,349 INFO L78 Accepts]: Start accepts. Automaton has 61202 states and 105400 transitions. Word has length 126 [2025-01-09 05:21:28,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:21:28,349 INFO L471 AbstractCegarLoop]: Abstraction has 61202 states and 105400 transitions. [2025-01-09 05:21:28,349 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:21:28,350 INFO L276 IsEmpty]: Start isEmpty. Operand 61202 states and 105400 transitions. [2025-01-09 05:21:28,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 05:21:28,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:28,424 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:21:28,431 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 05:21:28,624 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:21:28,625 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:28,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:28,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1024627669, now seen corresponding path program 1 times [2025-01-09 05:21:28,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:28,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071056308] [2025-01-09 05:21:28,626 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:28,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:28,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 05:21:28,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 05:21:28,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:28,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:28,697 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:21:28,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:28,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071056308] [2025-01-09 05:21:28,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071056308] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:21:28,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [349387120] [2025-01-09 05:21:28,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:28,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:21:28,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:21:28,701 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:21:28,703 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:21:28,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 05:21:28,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 05:21:28,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:28,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:28,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:21:28,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:21:28,819 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:21:28,820 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:21:28,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [349387120] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:28,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:21:28,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 05:21:28,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565119298] [2025-01-09 05:21:28,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:28,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:21:28,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:28,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:21:28,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:21:28,822 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:21:31,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:21:31,605 INFO L93 Difference]: Finished difference Result 99098 states and 167215 transitions. [2025-01-09 05:21:31,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:21:31,606 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:21:31,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:21:32,036 INFO L225 Difference]: With dead ends: 99098 [2025-01-09 05:21:32,036 INFO L226 Difference]: Without dead ends: 79290 [2025-01-09 05:21:32,127 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:21:32,128 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:21:32,129 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:21:32,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79290 states. [2025-01-09 05:21:35,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79290 to 79290. [2025-01-09 05:21:36,039 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:21:36,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79290 states to 79290 states and 134692 transitions. [2025-01-09 05:21:36,320 INFO L78 Accepts]: Start accepts. Automaton has 79290 states and 134692 transitions. Word has length 126 [2025-01-09 05:21:36,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:21:36,321 INFO L471 AbstractCegarLoop]: Abstraction has 79290 states and 134692 transitions. [2025-01-09 05:21:36,321 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:21:36,321 INFO L276 IsEmpty]: Start isEmpty. Operand 79290 states and 134692 transitions. [2025-01-09 05:21:36,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 05:21:36,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:21:36,502 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:21:36,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 05:21:36,703 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:21:36,703 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting errorErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, errorErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:21:36,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:21:36,704 INFO L85 PathProgramCache]: Analyzing trace with hash 260587635, now seen corresponding path program 1 times [2025-01-09 05:21:36,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:21:36,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606081742] [2025-01-09 05:21:36,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:36,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:21:36,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 05:21:36,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 05:21:36,715 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:36,715 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:36,777 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:21:36,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:21:36,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606081742] [2025-01-09 05:21:36,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606081742] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:21:36,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1709853535] [2025-01-09 05:21:36,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:21:36,778 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:21:36,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:21:36,781 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:21:36,782 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:21:36,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 05:21:37,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 05:21:37,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:21:37,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:21:37,171 INFO L256 TraceCheckSpWp]: Trace formula consists of 592 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 05:21:37,177 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:21:37,322 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:21:37,322 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 05:21:37,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1709853535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:21:37,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 05:21:37,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-01-09 05:21:37,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465883081] [2025-01-09 05:21:37,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:21:37,326 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:21:37,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:21:37,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:21:37,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:21:37,327 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)