./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekh_ctm.2-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/seq-mthreaded/rekh_ctm.2-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 cdfe8cdf5ef6acb015ae980f200d66be6855e21e0a93c803bebabec43209e961 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:33:17,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:33:17,190 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 04:33:17,193 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:33:17,194 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:33:17,210 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:33:17,211 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:33:17,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:33:17,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:33:17,212 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:33:17,212 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:33:17,212 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:33:17,212 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:33:17,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:33:17,212 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:33:17,212 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:33:17,212 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:33:17,212 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:33:17,213 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:33:17,213 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:33:17,213 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:33:17,213 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:33:17,213 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:33:17,213 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:33:17,213 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:33:17,213 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:33:17,213 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:33:17,213 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:33:17,214 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:33:17,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:33:17,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:33:17,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:33:17,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:33:17,214 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:33:17,214 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:33:17,214 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:33:17,214 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:33:17,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:33:17,215 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:33:17,215 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:33:17,215 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:33:17,215 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:33:17,215 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:33:17,215 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:33:17,215 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:33:17,215 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:33:17,215 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:33:17,215 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:33:17,215 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 -> cdfe8cdf5ef6acb015ae980f200d66be6855e21e0a93c803bebabec43209e961 [2025-01-09 04:33:17,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:33:17,472 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:33:17,474 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:33:17,475 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:33:17,475 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:33:17,478 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekh_ctm.2-1.c [2025-01-09 04:33:18,620 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c1e0f5ab/fdb36f9e6a254442b514128b8312a920/FLAGc4761b40f [2025-01-09 04:33:19,052 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:33:19,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_ctm.2-1.c [2025-01-09 04:33:19,069 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c1e0f5ab/fdb36f9e6a254442b514128b8312a920/FLAGc4761b40f [2025-01-09 04:33:19,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6c1e0f5ab/fdb36f9e6a254442b514128b8312a920 [2025-01-09 04:33:19,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:33:19,085 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:33:19,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:33:19,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:33:19,089 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:33:19,090 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:19,091 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c73d713 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19, skipping insertion in model container [2025-01-09 04:33:19,091 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:19,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:33:19,288 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/seq-mthreaded/rekh_ctm.2-1.c[1871,1884] [2025-01-09 04:33:19,646 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:33:19,674 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:33:19,685 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/ctm.bug2.i","-S") [42] [2025-01-09 04:33:19,691 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/seq-mthreaded/rekh_ctm.2-1.c[1871,1884] [2025-01-09 04:33:19,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:33:19,972 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:33:19,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19 WrapperNode [2025-01-09 04:33:19,975 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:33:19,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:33:19,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:33:19,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:33:19,981 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:20,033 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:20,257 INFO L138 Inliner]: procedures = 99, calls = 2724, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 8507 [2025-01-09 04:33:20,257 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:33:20,258 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:33:20,258 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:33:20,258 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:33:20,265 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:20,265 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:20,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:20,379 INFO L175 MemorySlicer]: Split 2332 memory accesses to 49 slices as follows [2, 80, 86, 37, 37, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46, 49, 46]. 4 percent of accesses are in the largest equivalence class. The 338 initializations are split as follows [2, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7]. The 402 writes are split as follows [0, 7, 7, 7, 7, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6, 11, 6]. [2025-01-09 04:33:20,379 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:20,379 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:20,567 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:20,580 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:20,610 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:20,647 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:20,671 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:20,750 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:33:20,752 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:33:20,752 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:33:20,753 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:33:20,754 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (1/1) ... [2025-01-09 04:33:20,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:33:20,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:33:20,793 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 04:33:20,816 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 04:33:20,849 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_state [2025-01-09 04:33:20,853 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_state [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_state [2025-01-09 04:33:20,854 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_state [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-01-09 04:33:20,854 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#27 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#28 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#29 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#30 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#31 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#32 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#33 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#34 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#35 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#36 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#37 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#38 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#39 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#40 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#41 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#42 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#43 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#44 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#45 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#46 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#47 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#48 [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_run_nxtbg [2025-01-09 04:33:20,855 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_run_nxtbg [2025-01-09 04:33:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-01-09 04:33:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-01-09 04:33:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write___startrek_current_priority [2025-01-09 04:33:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write___startrek_current_priority [2025-01-09 04:33:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_input [2025-01-09 04:33:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_input [2025-01-09 04:33:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_hyperperiod [2025-01-09 04:33:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_hyperperiod [2025-01-09 04:33:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure bg_nxtcolorsensor [2025-01-09 04:33:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure bg_nxtcolorsensor [2025-01-09 04:33:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Writer [2025-01-09 04:33:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Writer [2025-01-09 04:33:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_mode [2025-01-09 04:33:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_mode [2025-01-09 04:33:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 04:33:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 04:33:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 04:33:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#27 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#28 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#29 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#30 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#31 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#32 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#33 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#34 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#35 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#36 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#37 [2025-01-09 04:33:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#38 [2025-01-09 04:33:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#39 [2025-01-09 04:33:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#40 [2025-01-09 04:33:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#41 [2025-01-09 04:33:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#42 [2025-01-09 04:33:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#43 [2025-01-09 04:33:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#44 [2025-01-09 04:33:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#45 [2025-01-09 04:33:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#46 [2025-01-09 04:33:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#47 [2025-01-09 04:33:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#48 [2025-01-09 04:33:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-01-09 04:33:20,859 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-01-09 04:33:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_count [2025-01-09 04:33:20,859 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_count [2025-01-09 04:33:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_T_state [2025-01-09 04:33:20,859 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_T_state [2025-01-09 04:33:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_output [2025-01-09 04:33:20,859 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_output [2025-01-09 04:33:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure move_motor [2025-01-09 04:33:20,859 INFO L138 BoogieDeclarations]: Found implementation of procedure move_motor [2025-01-09 04:33:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_speed [2025-01-09 04:33:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_speed [2025-01-09 04:33:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-01-09 04:33:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-01-09 04:33:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:33:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-01-09 04:33:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-01-09 04:33:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_set_nxtcolorsensor [2025-01-09 04:33:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_set_nxtcolorsensor [2025-01-09 04:33:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t3 [2025-01-09 04:33:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t3 [2025-01-09 04:33:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_output [2025-01-09 04:33:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_output [2025-01-09 04:33:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-01-09 04:33:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-01-09 04:33:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_T_count [2025-01-09 04:33:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_T_count [2025-01-09 04:33:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-01-09 04:33:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-01-09 04:33:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure TerminateTask [2025-01-09 04:33:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure TerminateTask [2025-01-09 04:33:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_W_count [2025-01-09 04:33:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_W_count [2025-01-09 04:33:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read___startrek_current_priority [2025-01-09 04:33:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read___startrek_current_priority [2025-01-09 04:33:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_count [2025-01-09 04:33:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_count [2025-01-09 04:33:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_count [2025-01-09 04:33:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_count [2025-01-09 04:33:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_speed [2025-01-09 04:33:20,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_speed [2025-01-09 04:33:20,866 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_data_mode [2025-01-09 04:33:20,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_data_mode [2025-01-09 04:33:20,866 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_threshold [2025-01-09 04:33:20,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_threshold [2025-01-09 04:33:20,866 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_read [2025-01-09 04:33:20,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_read [2025-01-09 04:33:20,866 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_R_state [2025-01-09 04:33:20,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_R_state [2025-01-09 04:33:20,866 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Reader [2025-01-09 04:33:20,869 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Reader [2025-01-09 04:33:20,869 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_dir [2025-01-09 04:33:20,869 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_dir [2025-01-09 04:33:20,869 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_speed [2025-01-09 04:33:20,869 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_speed [2025-01-09 04:33:20,869 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_input [2025-01-09 04:33:20,869 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_input [2025-01-09 04:33:20,869 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_state [2025-01-09 04:33:20,869 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_state [2025-01-09 04:33:20,869 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_W_state [2025-01-09 04:33:20,869 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_W_state [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_R_count [2025-01-09 04:33:20,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_R_count [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_TapeMover [2025-01-09 04:33:20,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_TapeMover [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_get_nxtcolorsensor_mode [2025-01-09 04:33:20,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_get_nxtcolorsensor_mode [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#27 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#28 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#29 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#30 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#31 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#32 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#33 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#34 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#35 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#36 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#37 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#38 [2025-01-09 04:33:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#39 [2025-01-09 04:33:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#40 [2025-01-09 04:33:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#41 [2025-01-09 04:33:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#42 [2025-01-09 04:33:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#43 [2025-01-09 04:33:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#44 [2025-01-09 04:33:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#45 [2025-01-09 04:33:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#46 [2025-01-09 04:33:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#47 [2025-01-09 04:33:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#48 [2025-01-09 04:33:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Controller [2025-01-09 04:33:20,871 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Controller [2025-01-09 04:33:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:33:20,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:33:21,438 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:33:21,440 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:33:31,934 INFO L? ?]: Removed 940 outVars from TransFormulas that were not future-live. [2025-01-09 04:33:31,934 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:33:31,973 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:33:31,973 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 04:33:31,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:33:31 BoogieIcfgContainer [2025-01-09 04:33:31,974 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:33:31,976 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:33:31,976 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:33:31,981 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:33:31,981 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:33:19" (1/3) ... [2025-01-09 04:33:31,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7791765b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:33:31, skipping insertion in model container [2025-01-09 04:33:31,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:19" (2/3) ... [2025-01-09 04:33:31,982 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7791765b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:33:31, skipping insertion in model container [2025-01-09 04:33:31,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:33:31" (3/3) ... [2025-01-09 04:33:31,984 INFO L128 eAbstractionObserver]: Analyzing ICFG rekh_ctm.2-1.c [2025-01-09 04:33:31,996 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:33:32,000 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekh_ctm.2-1.c that has 45 procedures, 2453 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:33:32,108 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:33:32,118 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;@18baa793, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:33:32,119 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:33:32,130 INFO L276 IsEmpty]: Start isEmpty. Operand has 2453 states, 2105 states have (on average 1.4807600950118764) internal successors, (3117), 2129 states have internal predecessors, (3117), 302 states have call successors, (302), 44 states have call predecessors, (302), 44 states have return successors, (302), 292 states have call predecessors, (302), 302 states have call successors, (302) [2025-01-09 04:33:32,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 04:33:32,148 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:33:32,149 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 04:33:32,149 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:33:32,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:33:32,154 INFO L85 PathProgramCache]: Analyzing trace with hash 467088465, now seen corresponding path program 1 times [2025-01-09 04:33:32,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:33:32,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [393735692] [2025-01-09 04:33:32,160 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:32,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:33:32,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 04:33:32,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 04:33:32,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:33:32,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:33:33,030 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 04:33:33,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:33:33,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [393735692] [2025-01-09 04:33:33,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [393735692] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:33:33,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:33:33,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:33:33,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869931904] [2025-01-09 04:33:33,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:33:33,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:33:33,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:33:33,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:33:33,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:33:33,063 INFO L87 Difference]: Start difference. First operand has 2453 states, 2105 states have (on average 1.4807600950118764) internal successors, (3117), 2129 states have internal predecessors, (3117), 302 states have call successors, (302), 44 states have call predecessors, (302), 44 states have return successors, (302), 292 states have call predecessors, (302), 302 states have call successors, (302) Second operand has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:33:33,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:33:33,213 INFO L93 Difference]: Finished difference Result 4897 states and 7686 transitions. [2025-01-09 04:33:33,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:33:33,215 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 148 [2025-01-09 04:33:33,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:33:33,248 INFO L225 Difference]: With dead ends: 4897 [2025-01-09 04:33:33,248 INFO L226 Difference]: Without dead ends: 2440 [2025-01-09 04:33:33,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:33:33,275 INFO L435 NwaCegarLoop]: 3025 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3025 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:33:33,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3025 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:33:33,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2440 states. [2025-01-09 04:33:33,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2440 to 2440. [2025-01-09 04:33:33,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2440 states, 2093 states have (on average 1.1528905876731963) internal successors, (2413), 2117 states have internal predecessors, (2413), 302 states have call successors, (302), 44 states have call predecessors, (302), 44 states have return successors, (301), 291 states have call predecessors, (301), 301 states have call successors, (301) [2025-01-09 04:33:33,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2440 states to 2440 states and 3016 transitions. [2025-01-09 04:33:33,423 INFO L78 Accepts]: Start accepts. Automaton has 2440 states and 3016 transitions. Word has length 148 [2025-01-09 04:33:33,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:33:33,424 INFO L471 AbstractCegarLoop]: Abstraction has 2440 states and 3016 transitions. [2025-01-09 04:33:33,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 04:33:33,424 INFO L276 IsEmpty]: Start isEmpty. Operand 2440 states and 3016 transitions. [2025-01-09 04:33:33,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 04:33:33,433 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:33:33,434 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:33,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:33:33,434 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:33:33,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:33:33,435 INFO L85 PathProgramCache]: Analyzing trace with hash -973175054, now seen corresponding path program 1 times [2025-01-09 04:33:33,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:33:33,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613810700] [2025-01-09 04:33:33,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:33,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:33:33,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 04:33:34,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 04:33:34,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:33:34,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:33:34,911 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 04:33:34,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:33:34,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613810700] [2025-01-09 04:33:34,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613810700] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:33:34,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:33:34,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:33:34,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1129583206] [2025-01-09 04:33:34,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:33:34,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:33:34,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:33:34,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:33:34,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:33:34,917 INFO L87 Difference]: Start difference. First operand 2440 states and 3016 transitions. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:33:38,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:33:38,226 INFO L93 Difference]: Finished difference Result 5518 states and 6918 transitions. [2025-01-09 04:33:38,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:33:38,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 208 [2025-01-09 04:33:38,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:33:38,245 INFO L225 Difference]: With dead ends: 5518 [2025-01-09 04:33:38,245 INFO L226 Difference]: Without dead ends: 3083 [2025-01-09 04:33:38,258 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:33:38,259 INFO L435 NwaCegarLoop]: 3611 mSDtfsCounter, 5754 mSDsluCounter, 4558 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 475 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5754 SdHoareTripleChecker+Valid, 8169 SdHoareTripleChecker+Invalid, 2491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 475 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:33:38,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5754 Valid, 8169 Invalid, 2491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [475 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 04:33:38,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3083 states. [2025-01-09 04:33:38,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3083 to 2947. [2025-01-09 04:33:38,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2947 states, 2457 states have (on average 1.1851851851851851) internal successors, (2912), 2487 states have internal predecessors, (2912), 413 states have call successors, (413), 76 states have call predecessors, (413), 76 states have return successors, (412), 398 states have call predecessors, (412), 412 states have call successors, (412) [2025-01-09 04:33:38,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2947 states to 2947 states and 3737 transitions. [2025-01-09 04:33:38,357 INFO L78 Accepts]: Start accepts. Automaton has 2947 states and 3737 transitions. Word has length 208 [2025-01-09 04:33:38,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:33:38,359 INFO L471 AbstractCegarLoop]: Abstraction has 2947 states and 3737 transitions. [2025-01-09 04:33:38,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (10), 2 states have call predecessors, (10), 4 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:33:38,360 INFO L276 IsEmpty]: Start isEmpty. Operand 2947 states and 3737 transitions. [2025-01-09 04:33:38,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 04:33:38,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:33:38,367 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:38,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:33:38,368 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:33:38,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:33:38,368 INFO L85 PathProgramCache]: Analyzing trace with hash -727244873, now seen corresponding path program 1 times [2025-01-09 04:33:38,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:33:38,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860823307] [2025-01-09 04:33:38,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:38,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:33:38,713 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 04:33:38,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 04:33:38,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:33:38,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:33:40,461 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-09 04:33:40,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:33:40,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860823307] [2025-01-09 04:33:40,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860823307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:33:40,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:33:40,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:33:40,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863845202] [2025-01-09 04:33:40,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:33:40,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:33:40,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:33:40,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:33:40,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:33:40,464 INFO L87 Difference]: Start difference. First operand 2947 states and 3737 transitions. Second operand has 5 states, 4 states have (on average 45.5) internal successors, (182), 5 states have internal predecessors, (182), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:33:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:33:42,576 INFO L93 Difference]: Finished difference Result 6275 states and 8029 transitions. [2025-01-09 04:33:42,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:33:42,577 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 45.5) internal successors, (182), 5 states have internal predecessors, (182), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) Word has length 205 [2025-01-09 04:33:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:33:42,600 INFO L225 Difference]: With dead ends: 6275 [2025-01-09 04:33:42,600 INFO L226 Difference]: Without dead ends: 3333 [2025-01-09 04:33:42,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:33:42,615 INFO L435 NwaCegarLoop]: 3405 mSDtfsCounter, 3651 mSDsluCounter, 3337 mSDsCounter, 0 mSdLazyCounter, 1651 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3651 SdHoareTripleChecker+Valid, 6742 SdHoareTripleChecker+Invalid, 1659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:33:42,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3651 Valid, 6742 Invalid, 1659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1651 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 04:33:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3333 states. [2025-01-09 04:33:42,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3333 to 3331. [2025-01-09 04:33:42,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3331 states, 2739 states have (on average 1.2059145673603504) internal successors, (3303), 2778 states have internal predecessors, (3303), 494 states have call successors, (494), 97 states have call predecessors, (494), 97 states have return successors, (493), 475 states have call predecessors, (493), 493 states have call successors, (493) [2025-01-09 04:33:42,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 4290 transitions. [2025-01-09 04:33:42,778 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 4290 transitions. Word has length 205 [2025-01-09 04:33:42,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:33:42,783 INFO L471 AbstractCegarLoop]: Abstraction has 3331 states and 4290 transitions. [2025-01-09 04:33:42,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 45.5) internal successors, (182), 5 states have internal predecessors, (182), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 3 states have call successors, (7) [2025-01-09 04:33:42,784 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 4290 transitions. [2025-01-09 04:33:42,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 04:33:42,789 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:33:42,790 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:42,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:33:42,790 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:33:42,796 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:33:42,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1146328816, now seen corresponding path program 1 times [2025-01-09 04:33:42,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:33:42,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794665648] [2025-01-09 04:33:42,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:42,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:33:43,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 04:33:43,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 04:33:43,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:33:43,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:33:43,798 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-09 04:33:43,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:33:43,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794665648] [2025-01-09 04:33:43,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794665648] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:33:43,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1581928850] [2025-01-09 04:33:43,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:43,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:33:43,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:33:43,801 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 04:33:43,803 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 04:33:44,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 04:33:44,817 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 04:33:44,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:33:44,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:33:44,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 2846 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 04:33:44,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:33:44,939 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 04:33:44,941 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:33:44,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1581928850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:33:44,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:33:44,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-01-09 04:33:44,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305883914] [2025-01-09 04:33:44,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:33:44,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:33:44,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:33:44,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:33:44,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:33:44,943 INFO L87 Difference]: Start difference. First operand 3331 states and 4290 transitions. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:33:46,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:33:46,578 INFO L93 Difference]: Finished difference Result 6859 states and 8820 transitions. [2025-01-09 04:33:46,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:33:46,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 208 [2025-01-09 04:33:46,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:33:46,595 INFO L225 Difference]: With dead ends: 6859 [2025-01-09 04:33:46,595 INFO L226 Difference]: Without dead ends: 3454 [2025-01-09 04:33:46,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:33:46,607 INFO L435 NwaCegarLoop]: 3556 mSDtfsCounter, 1461 mSDsluCounter, 8304 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1461 SdHoareTripleChecker+Valid, 11860 SdHoareTripleChecker+Invalid, 1589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:33:46,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1461 Valid, 11860 Invalid, 1589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1587 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 04:33:46,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3454 states. [2025-01-09 04:33:46,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3454 to 3318. [2025-01-09 04:33:46,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3318 states, 2731 states have (on average 1.204320761625778) internal successors, (3289), 2770 states have internal predecessors, (3289), 489 states have call successors, (489), 97 states have call predecessors, (489), 97 states have return successors, (488), 470 states have call predecessors, (488), 488 states have call successors, (488) [2025-01-09 04:33:46,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3318 states to 3318 states and 4266 transitions. [2025-01-09 04:33:46,685 INFO L78 Accepts]: Start accepts. Automaton has 3318 states and 4266 transitions. Word has length 208 [2025-01-09 04:33:46,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:33:46,685 INFO L471 AbstractCegarLoop]: Abstraction has 3318 states and 4266 transitions. [2025-01-09 04:33:46,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:33:46,686 INFO L276 IsEmpty]: Start isEmpty. Operand 3318 states and 4266 transitions. [2025-01-09 04:33:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 04:33:46,689 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:33:46,689 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:46,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 04:33:46,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:33:46,894 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:33:46,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:33:46,895 INFO L85 PathProgramCache]: Analyzing trace with hash 680869527, now seen corresponding path program 1 times [2025-01-09 04:33:46,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:33:46,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184468318] [2025-01-09 04:33:46,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:46,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:33:47,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 04:33:47,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 04:33:47,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:33:47,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:33:47,694 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:33:47,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:33:47,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184468318] [2025-01-09 04:33:47,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184468318] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:33:47,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [41651288] [2025-01-09 04:33:47,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:47,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:33:47,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:33:47,697 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 04:33:47,699 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 04:33:48,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 04:33:48,864 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 04:33:48,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:33:48,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:33:48,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 2848 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:33:48,887 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:33:48,979 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-09 04:33:48,982 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:33:48,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [41651288] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:33:48,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:33:48,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-01-09 04:33:48,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054320242] [2025-01-09 04:33:48,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:33:48,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:33:48,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:33:48,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:33:48,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:33:48,984 INFO L87 Difference]: Start difference. First operand 3318 states and 4266 transitions. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:33:51,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:33:51,045 INFO L93 Difference]: Finished difference Result 8489 states and 10924 transitions. [2025-01-09 04:33:51,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:33:51,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 209 [2025-01-09 04:33:51,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:33:51,072 INFO L225 Difference]: With dead ends: 8489 [2025-01-09 04:33:51,072 INFO L226 Difference]: Without dead ends: 5176 [2025-01-09 04:33:51,083 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:33:51,084 INFO L435 NwaCegarLoop]: 4671 mSDtfsCounter, 2352 mSDsluCounter, 8209 mSDsCounter, 0 mSdLazyCounter, 1697 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2352 SdHoareTripleChecker+Valid, 12880 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:33:51,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2352 Valid, 12880 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1697 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 04:33:51,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5176 states. [2025-01-09 04:33:51,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5176 to 4709. [2025-01-09 04:33:51,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4709 states, 3816 states have (on average 1.2237945492662474) internal successors, (4670), 3876 states have internal predecessors, (4670), 740 states have call successors, (740), 150 states have call predecessors, (740), 152 states have return successors, (743), 714 states have call predecessors, (743), 739 states have call successors, (743) [2025-01-09 04:33:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4709 states to 4709 states and 6153 transitions. [2025-01-09 04:33:51,267 INFO L78 Accepts]: Start accepts. Automaton has 4709 states and 6153 transitions. Word has length 209 [2025-01-09 04:33:51,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:33:51,267 INFO L471 AbstractCegarLoop]: Abstraction has 4709 states and 6153 transitions. [2025-01-09 04:33:51,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:33:51,268 INFO L276 IsEmpty]: Start isEmpty. Operand 4709 states and 6153 transitions. [2025-01-09 04:33:51,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 04:33:51,273 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:33:51,273 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:51,285 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 04:33:51,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:33:51,474 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:33:51,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:33:51,475 INFO L85 PathProgramCache]: Analyzing trace with hash 333648682, now seen corresponding path program 1 times [2025-01-09 04:33:51,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:33:51,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060913276] [2025-01-09 04:33:51,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:51,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:33:51,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 04:33:51,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 04:33:51,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:33:51,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:33:52,241 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:33:52,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:33:52,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060913276] [2025-01-09 04:33:52,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060913276] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:33:52,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2068227778] [2025-01-09 04:33:52,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:52,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:33:52,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:33:52,248 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 04:33:52,254 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 04:33:53,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 04:33:53,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 04:33:53,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:33:53,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:33:53,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 2850 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:33:53,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:33:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:33:54,047 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:33:54,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2068227778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:33:54,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:33:54,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-01-09 04:33:54,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288770426] [2025-01-09 04:33:54,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:33:54,048 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:33:54,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:33:54,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:33:54,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:33:54,049 INFO L87 Difference]: Start difference. First operand 4709 states and 6153 transitions. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:33:56,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:33:56,064 INFO L93 Difference]: Finished difference Result 10575 states and 13853 transitions. [2025-01-09 04:33:56,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:33:56,065 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 210 [2025-01-09 04:33:56,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:33:56,099 INFO L225 Difference]: With dead ends: 10575 [2025-01-09 04:33:56,099 INFO L226 Difference]: Without dead ends: 5871 [2025-01-09 04:33:56,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:33:56,115 INFO L435 NwaCegarLoop]: 3897 mSDtfsCounter, 1717 mSDsluCounter, 9090 mSDsCounter, 0 mSdLazyCounter, 1625 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1717 SdHoareTripleChecker+Valid, 12987 SdHoareTripleChecker+Invalid, 1628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:33:56,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1717 Valid, 12987 Invalid, 1628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1625 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 04:33:56,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5871 states. [2025-01-09 04:33:56,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5871 to 5217. [2025-01-09 04:33:56,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5217 states, 4102 states have (on average 1.2618235007313505) internal successors, (5176), 4180 states have internal predecessors, (5176), 920 states have call successors, (920), 191 states have call predecessors, (920), 194 states have return successors, (922), 887 states have call predecessors, (922), 919 states have call successors, (922) [2025-01-09 04:33:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5217 states to 5217 states and 7018 transitions. [2025-01-09 04:33:56,333 INFO L78 Accepts]: Start accepts. Automaton has 5217 states and 7018 transitions. Word has length 210 [2025-01-09 04:33:56,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:33:56,334 INFO L471 AbstractCegarLoop]: Abstraction has 5217 states and 7018 transitions. [2025-01-09 04:33:56,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:33:56,335 INFO L276 IsEmpty]: Start isEmpty. Operand 5217 states and 7018 transitions. [2025-01-09 04:33:56,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 04:33:56,342 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:33:56,342 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:56,357 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 04:33:56,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:33:56,543 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:33:56,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:33:56,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1637927696, now seen corresponding path program 1 times [2025-01-09 04:33:56,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:33:56,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999510501] [2025-01-09 04:33:56,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:56,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:33:56,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 04:33:56,870 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 04:33:56,870 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:33:56,870 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:33:57,246 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-09 04:33:57,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:33:57,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999510501] [2025-01-09 04:33:57,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999510501] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:33:57,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1372147016] [2025-01-09 04:33:57,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:57,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:33:57,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:33:57,251 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 04:33:57,264 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 04:33:58,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 04:33:58,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 04:33:58,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:33:58,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:33:58,359 INFO L256 TraceCheckSpWp]: Trace formula consists of 2848 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:33:58,364 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:33:58,451 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-09 04:33:58,452 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:33:58,452 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1372147016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:33:58,452 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:33:58,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-01-09 04:33:58,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142746360] [2025-01-09 04:33:58,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:33:58,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:33:58,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:33:58,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:33:58,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:33:58,453 INFO L87 Difference]: Start difference. First operand 5217 states and 7018 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:33:59,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:33:59,659 INFO L93 Difference]: Finished difference Result 10431 states and 14038 transitions. [2025-01-09 04:33:59,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:33:59,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) Word has length 210 [2025-01-09 04:33:59,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:33:59,689 INFO L225 Difference]: With dead ends: 10431 [2025-01-09 04:33:59,689 INFO L226 Difference]: Without dead ends: 5219 [2025-01-09 04:33:59,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 04:33:59,705 INFO L435 NwaCegarLoop]: 2928 mSDtfsCounter, 1047 mSDsluCounter, 7564 mSDsCounter, 0 mSdLazyCounter, 1128 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 10492 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:33:59,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 10492 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1128 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 04:33:59,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5219 states. [2025-01-09 04:33:59,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5219 to 5217. [2025-01-09 04:33:59,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5217 states, 4102 states have (on average 1.2615797172111165) internal successors, (5175), 4180 states have internal predecessors, (5175), 920 states have call successors, (920), 191 states have call predecessors, (920), 194 states have return successors, (922), 887 states have call predecessors, (922), 919 states have call successors, (922) [2025-01-09 04:33:59,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5217 states to 5217 states and 7017 transitions. [2025-01-09 04:33:59,871 INFO L78 Accepts]: Start accepts. Automaton has 5217 states and 7017 transitions. Word has length 210 [2025-01-09 04:33:59,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:33:59,872 INFO L471 AbstractCegarLoop]: Abstraction has 5217 states and 7017 transitions. [2025-01-09 04:33:59,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 3 states have call successors, (8) [2025-01-09 04:33:59,872 INFO L276 IsEmpty]: Start isEmpty. Operand 5217 states and 7017 transitions. [2025-01-09 04:33:59,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 04:33:59,880 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:33:59,880 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:33:59,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 04:34:00,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-01-09 04:34:00,081 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:00,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:00,082 INFO L85 PathProgramCache]: Analyzing trace with hash -168500393, now seen corresponding path program 1 times [2025-01-09 04:34:00,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:00,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808603453] [2025-01-09 04:34:00,083 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:00,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:00,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 04:34:00,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 04:34:00,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:00,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:00,947 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 04:34:00,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:00,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808603453] [2025-01-09 04:34:00,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808603453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:00,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:00,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:00,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392638429] [2025-01-09 04:34:00,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:00,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:00,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:00,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:00,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:00,949 INFO L87 Difference]: Start difference. First operand 5217 states and 7017 transitions. Second operand has 6 states, 6 states have (on average 30.5) internal successors, (183), 6 states have internal predecessors, (183), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:34:03,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:03,302 INFO L93 Difference]: Finished difference Result 9500 states and 12635 transitions. [2025-01-09 04:34:03,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:03,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.5) internal successors, (183), 6 states have internal predecessors, (183), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 217 [2025-01-09 04:34:03,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:03,333 INFO L225 Difference]: With dead ends: 9500 [2025-01-09 04:34:03,333 INFO L226 Difference]: Without dead ends: 4288 [2025-01-09 04:34:03,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:34:03,351 INFO L435 NwaCegarLoop]: 3493 mSDtfsCounter, 6666 mSDsluCounter, 2711 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 787 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6666 SdHoareTripleChecker+Valid, 6204 SdHoareTripleChecker+Invalid, 2057 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 787 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:03,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6666 Valid, 6204 Invalid, 2057 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [787 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 04:34:03,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2025-01-09 04:34:03,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 4150. [2025-01-09 04:34:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4150 states, 3339 states have (on average 1.2345013477088949) internal successors, (4122), 3395 states have internal predecessors, (4122), 669 states have call successors, (669), 140 states have call predecessors, (669), 141 states have return successors, (669), 644 states have call predecessors, (669), 668 states have call successors, (669) [2025-01-09 04:34:03,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4150 states to 4150 states and 5460 transitions. [2025-01-09 04:34:03,478 INFO L78 Accepts]: Start accepts. Automaton has 4150 states and 5460 transitions. Word has length 217 [2025-01-09 04:34:03,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:03,478 INFO L471 AbstractCegarLoop]: Abstraction has 4150 states and 5460 transitions. [2025-01-09 04:34:03,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.5) internal successors, (183), 6 states have internal predecessors, (183), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:34:03,479 INFO L276 IsEmpty]: Start isEmpty. Operand 4150 states and 5460 transitions. [2025-01-09 04:34:03,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-01-09 04:34:03,484 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:03,485 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:03,485 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 04:34:03,485 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:03,486 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:03,486 INFO L85 PathProgramCache]: Analyzing trace with hash 326792426, now seen corresponding path program 1 times [2025-01-09 04:34:03,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:03,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [677270964] [2025-01-09 04:34:03,486 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:03,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:03,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 04:34:03,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 04:34:03,878 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:03,878 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:04,281 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-09 04:34:04,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:04,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [677270964] [2025-01-09 04:34:04,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [677270964] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:34:04,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2091016988] [2025-01-09 04:34:04,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:04,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:04,282 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:34:04,287 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:34:04,293 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 04:34:05,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-01-09 04:34:05,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-01-09 04:34:05,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:05,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:05,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 2874 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:34:05,486 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:34:05,551 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:34:05,551 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:34:05,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2091016988] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:05,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:34:05,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-01-09 04:34:05,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199506278] [2025-01-09 04:34:05,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:05,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:05,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:05,553 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:05,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:34:05,553 INFO L87 Difference]: Start difference. First operand 4150 states and 5460 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:34:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:06,699 INFO L93 Difference]: Finished difference Result 8427 states and 11071 transitions. [2025-01-09 04:34:06,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:06,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 218 [2025-01-09 04:34:06,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:06,719 INFO L225 Difference]: With dead ends: 8427 [2025-01-09 04:34:06,719 INFO L226 Difference]: Without dead ends: 4282 [2025-01-09 04:34:06,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:34:06,732 INFO L435 NwaCegarLoop]: 2914 mSDtfsCounter, 2531 mSDsluCounter, 4035 mSDsCounter, 0 mSdLazyCounter, 1043 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2531 SdHoareTripleChecker+Valid, 6949 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:06,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2531 Valid, 6949 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1043 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 04:34:06,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4282 states. [2025-01-09 04:34:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4282 to 4144. [2025-01-09 04:34:06,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 3336 states have (on average 1.2338129496402879) internal successors, (4116), 3392 states have internal predecessors, (4116), 666 states have call successors, (666), 140 states have call predecessors, (666), 141 states have return successors, (666), 641 states have call predecessors, (666), 665 states have call successors, (666) [2025-01-09 04:34:06,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5448 transitions. [2025-01-09 04:34:06,836 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5448 transitions. Word has length 218 [2025-01-09 04:34:06,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:06,837 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5448 transitions. [2025-01-09 04:34:06,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:34:06,837 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5448 transitions. [2025-01-09 04:34:06,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 04:34:06,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:06,843 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:06,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 04:34:07,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:07,044 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:07,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:07,044 INFO L85 PathProgramCache]: Analyzing trace with hash 1084325354, now seen corresponding path program 1 times [2025-01-09 04:34:07,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:07,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583286802] [2025-01-09 04:34:07,045 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:07,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:07,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 04:34:07,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 04:34:07,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:07,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:07,835 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 04:34:07,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:07,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583286802] [2025-01-09 04:34:07,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583286802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:07,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:07,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:07,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863509449] [2025-01-09 04:34:07,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:07,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:07,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:07,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:07,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:07,837 INFO L87 Difference]: Start difference. First operand 4144 states and 5448 transitions. Second operand has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:34:10,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:10,864 INFO L93 Difference]: Finished difference Result 7803 states and 10196 transitions. [2025-01-09 04:34:10,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:10,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 220 [2025-01-09 04:34:10,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:10,883 INFO L225 Difference]: With dead ends: 7803 [2025-01-09 04:34:10,883 INFO L226 Difference]: Without dead ends: 3664 [2025-01-09 04:34:10,897 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:34:10,897 INFO L435 NwaCegarLoop]: 3452 mSDtfsCounter, 5687 mSDsluCounter, 4446 mSDsCounter, 0 mSdLazyCounter, 2065 mSolverCounterSat, 542 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5687 SdHoareTripleChecker+Valid, 7898 SdHoareTripleChecker+Invalid, 2607 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 542 IncrementalHoareTripleChecker+Valid, 2065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:10,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5687 Valid, 7898 Invalid, 2607 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [542 Valid, 2065 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-01-09 04:34:10,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3664 states. [2025-01-09 04:34:10,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3664 to 3662. [2025-01-09 04:34:10,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3662 states, 2989 states have (on average 1.2167949146871864) internal successors, (3637), 3034 states have internal predecessors, (3637), 555 states have call successors, (555), 117 states have call predecessors, (555), 117 states have return successors, (554), 534 states have call predecessors, (554), 554 states have call successors, (554) [2025-01-09 04:34:10,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 4746 transitions. [2025-01-09 04:34:10,998 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 4746 transitions. Word has length 220 [2025-01-09 04:34:10,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:10,998 INFO L471 AbstractCegarLoop]: Abstraction has 3662 states and 4746 transitions. [2025-01-09 04:34:10,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 30.833333333333332) internal successors, (185), 6 states have internal predecessors, (185), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:34:10,999 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 4746 transitions. [2025-01-09 04:34:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 04:34:11,003 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:11,003 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:11,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 04:34:11,004 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:11,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:11,005 INFO L85 PathProgramCache]: Analyzing trace with hash -2023813552, now seen corresponding path program 1 times [2025-01-09 04:34:11,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:11,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615516230] [2025-01-09 04:34:11,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:11,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:11,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 04:34:11,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 04:34:11,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:11,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:11,986 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-09 04:34:11,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:11,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615516230] [2025-01-09 04:34:11,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615516230] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:34:11,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [796751570] [2025-01-09 04:34:11,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:11,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:11,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:34:11,989 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 04:34:11,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 04:34:12,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 04:34:13,174 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 04:34:13,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:13,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:13,190 INFO L256 TraceCheckSpWp]: Trace formula consists of 2876 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:34:13,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:34:13,295 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-09 04:34:13,295 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:34:13,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [796751570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:13,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:34:13,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-01-09 04:34:13,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32389818] [2025-01-09 04:34:13,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:13,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:13,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:13,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:13,297 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:34:13,297 INFO L87 Difference]: Start difference. First operand 3662 states and 4746 transitions. Second operand has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:34:14,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:14,933 INFO L93 Difference]: Finished difference Result 7319 states and 9491 transitions. [2025-01-09 04:34:14,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:14,934 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 220 [2025-01-09 04:34:14,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:14,955 INFO L225 Difference]: With dead ends: 7319 [2025-01-09 04:34:14,956 INFO L226 Difference]: Without dead ends: 3662 [2025-01-09 04:34:14,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:34:14,971 INFO L435 NwaCegarLoop]: 3022 mSDtfsCounter, 2494 mSDsluCounter, 4002 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2494 SdHoareTripleChecker+Valid, 7024 SdHoareTripleChecker+Invalid, 1087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:14,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2494 Valid, 7024 Invalid, 1087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 04:34:14,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2025-01-09 04:34:15,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3660. [2025-01-09 04:34:15,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3660 states, 2988 states have (on average 1.216532797858099) internal successors, (3635), 3033 states have internal predecessors, (3635), 554 states have call successors, (554), 117 states have call predecessors, (554), 117 states have return successors, (553), 533 states have call predecessors, (553), 553 states have call successors, (553) [2025-01-09 04:34:15,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3660 states to 3660 states and 4742 transitions. [2025-01-09 04:34:15,064 INFO L78 Accepts]: Start accepts. Automaton has 3660 states and 4742 transitions. Word has length 220 [2025-01-09 04:34:15,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:15,065 INFO L471 AbstractCegarLoop]: Abstraction has 3660 states and 4742 transitions. [2025-01-09 04:34:15,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.4) internal successors, (192), 5 states have internal predecessors, (192), 3 states have call successors, (11), 3 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:34:15,065 INFO L276 IsEmpty]: Start isEmpty. Operand 3660 states and 4742 transitions. [2025-01-09 04:34:15,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 04:34:15,069 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:15,069 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:15,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 04:34:15,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 04:34:15,270 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:15,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:15,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1448976072, now seen corresponding path program 1 times [2025-01-09 04:34:15,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:15,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040909369] [2025-01-09 04:34:15,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:15,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:15,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 04:34:15,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 04:34:15,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:15,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:15,911 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 04:34:15,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:15,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040909369] [2025-01-09 04:34:15,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040909369] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:15,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:15,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:15,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481766942] [2025-01-09 04:34:15,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:15,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:15,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:15,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:15,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:15,913 INFO L87 Difference]: Start difference. First operand 3660 states and 4742 transitions. Second operand has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:34:18,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:18,382 INFO L93 Difference]: Finished difference Result 7317 states and 9485 transitions. [2025-01-09 04:34:18,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:18,382 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 220 [2025-01-09 04:34:18,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:18,408 INFO L225 Difference]: With dead ends: 7317 [2025-01-09 04:34:18,409 INFO L226 Difference]: Without dead ends: 3662 [2025-01-09 04:34:18,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:34:18,421 INFO L435 NwaCegarLoop]: 3373 mSDtfsCounter, 5626 mSDsluCounter, 4427 mSDsCounter, 0 mSdLazyCounter, 2036 mSolverCounterSat, 566 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5626 SdHoareTripleChecker+Valid, 7800 SdHoareTripleChecker+Invalid, 2602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 566 IncrementalHoareTripleChecker+Valid, 2036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:18,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5626 Valid, 7800 Invalid, 2602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [566 Valid, 2036 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 04:34:18,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2025-01-09 04:34:18,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3660. [2025-01-09 04:34:18,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3660 states, 2988 states have (on average 1.21619812583668) internal successors, (3634), 3033 states have internal predecessors, (3634), 554 states have call successors, (554), 117 states have call predecessors, (554), 117 states have return successors, (553), 533 states have call predecessors, (553), 553 states have call successors, (553) [2025-01-09 04:34:18,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3660 states to 3660 states and 4741 transitions. [2025-01-09 04:34:18,521 INFO L78 Accepts]: Start accepts. Automaton has 3660 states and 4741 transitions. Word has length 220 [2025-01-09 04:34:18,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:18,521 INFO L471 AbstractCegarLoop]: Abstraction has 3660 states and 4741 transitions. [2025-01-09 04:34:18,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 3 states have call successors, (11), 2 states have call predecessors, (11), 4 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 04:34:18,522 INFO L276 IsEmpty]: Start isEmpty. Operand 3660 states and 4741 transitions. [2025-01-09 04:34:18,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-01-09 04:34:18,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:18,525 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:18,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:34:18,525 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:18,526 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:18,526 INFO L85 PathProgramCache]: Analyzing trace with hash -2081385613, now seen corresponding path program 1 times [2025-01-09 04:34:18,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:18,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843978483] [2025-01-09 04:34:18,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:18,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:18,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 04:34:18,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 04:34:18,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:18,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:19,160 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 04:34:19,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:19,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843978483] [2025-01-09 04:34:19,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1843978483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:19,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:19,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:19,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658917281] [2025-01-09 04:34:19,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:19,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:19,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:19,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:19,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:19,162 INFO L87 Difference]: Start difference. First operand 3660 states and 4741 transitions. Second operand has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 04:34:21,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:21,650 INFO L93 Difference]: Finished difference Result 7449 states and 9631 transitions. [2025-01-09 04:34:21,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:21,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 223 [2025-01-09 04:34:21,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:21,665 INFO L225 Difference]: With dead ends: 7449 [2025-01-09 04:34:21,666 INFO L226 Difference]: Without dead ends: 3794 [2025-01-09 04:34:21,674 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:21,675 INFO L435 NwaCegarLoop]: 3587 mSDtfsCounter, 3835 mSDsluCounter, 5521 mSDsCounter, 0 mSdLazyCounter, 2476 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3835 SdHoareTripleChecker+Valid, 9108 SdHoareTripleChecker+Invalid, 2486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:21,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3835 Valid, 9108 Invalid, 2486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2476 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 04:34:21,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3794 states. [2025-01-09 04:34:21,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3794 to 3658. [2025-01-09 04:34:21,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3658 states, 2987 states have (on average 1.2159357214596584) internal successors, (3632), 3032 states have internal predecessors, (3632), 553 states have call successors, (553), 117 states have call predecessors, (553), 117 states have return successors, (552), 532 states have call predecessors, (552), 552 states have call successors, (552) [2025-01-09 04:34:21,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 4737 transitions. [2025-01-09 04:34:21,775 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 4737 transitions. Word has length 223 [2025-01-09 04:34:21,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:21,776 INFO L471 AbstractCegarLoop]: Abstraction has 3658 states and 4737 transitions. [2025-01-09 04:34:21,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 04:34:21,776 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 4737 transitions. [2025-01-09 04:34:21,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-01-09 04:34:21,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:21,780 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:21,780 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:34:21,780 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:21,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:21,781 INFO L85 PathProgramCache]: Analyzing trace with hash 607914837, now seen corresponding path program 1 times [2025-01-09 04:34:21,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:21,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930641650] [2025-01-09 04:34:21,781 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:21,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:22,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 04:34:22,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 04:34:22,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:22,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:22,449 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 04:34:22,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:22,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930641650] [2025-01-09 04:34:22,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930641650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:22,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:22,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:22,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622032359] [2025-01-09 04:34:22,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:22,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:22,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:22,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:22,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:22,451 INFO L87 Difference]: Start difference. First operand 3658 states and 4737 transitions. Second operand has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 04:34:24,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:24,389 INFO L93 Difference]: Finished difference Result 7445 states and 9623 transitions. [2025-01-09 04:34:24,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:24,390 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 224 [2025-01-09 04:34:24,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:24,412 INFO L225 Difference]: With dead ends: 7445 [2025-01-09 04:34:24,412 INFO L226 Difference]: Without dead ends: 3792 [2025-01-09 04:34:24,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:24,429 INFO L435 NwaCegarLoop]: 3484 mSDtfsCounter, 5704 mSDsluCounter, 4542 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 551 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5704 SdHoareTripleChecker+Valid, 8026 SdHoareTripleChecker+Invalid, 2532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 551 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:24,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5704 Valid, 8026 Invalid, 2532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [551 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 04:34:24,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3792 states. [2025-01-09 04:34:24,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3792 to 3654. [2025-01-09 04:34:24,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3654 states, 2985 states have (on average 1.2154103852596314) internal successors, (3628), 3030 states have internal predecessors, (3628), 551 states have call successors, (551), 117 states have call predecessors, (551), 117 states have return successors, (550), 530 states have call predecessors, (550), 550 states have call successors, (550) [2025-01-09 04:34:24,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 4729 transitions. [2025-01-09 04:34:24,589 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 4729 transitions. Word has length 224 [2025-01-09 04:34:24,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:24,590 INFO L471 AbstractCegarLoop]: Abstraction has 3654 states and 4729 transitions. [2025-01-09 04:34:24,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2025-01-09 04:34:24,590 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 4729 transitions. [2025-01-09 04:34:24,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-09 04:34:24,592 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:24,592 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:24,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:34:24,593 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:24,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:24,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1513018662, now seen corresponding path program 1 times [2025-01-09 04:34:24,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:24,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266555679] [2025-01-09 04:34:24,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:24,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:24,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-09 04:34:24,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-09 04:34:24,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:24,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:25,256 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 04:34:25,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:25,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266555679] [2025-01-09 04:34:25,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266555679] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:25,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:25,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:25,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896008177] [2025-01-09 04:34:25,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:25,257 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:25,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:25,258 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:25,258 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:25,258 INFO L87 Difference]: Start difference. First operand 3654 states and 4729 transitions. Second operand has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 04:34:26,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:26,909 INFO L93 Difference]: Finished difference Result 7305 states and 9459 transitions. [2025-01-09 04:34:26,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:26,910 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 225 [2025-01-09 04:34:26,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:26,921 INFO L225 Difference]: With dead ends: 7305 [2025-01-09 04:34:26,921 INFO L226 Difference]: Without dead ends: 3656 [2025-01-09 04:34:26,929 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:34:26,929 INFO L435 NwaCegarLoop]: 3360 mSDtfsCounter, 6407 mSDsluCounter, 2567 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 790 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6407 SdHoareTripleChecker+Valid, 5927 SdHoareTripleChecker+Invalid, 2093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 790 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:26,930 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6407 Valid, 5927 Invalid, 2093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [790 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 04:34:26,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2025-01-09 04:34:27,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 3654. [2025-01-09 04:34:27,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3654 states, 2985 states have (on average 1.215075376884422) internal successors, (3627), 3030 states have internal predecessors, (3627), 551 states have call successors, (551), 117 states have call predecessors, (551), 117 states have return successors, (550), 530 states have call predecessors, (550), 550 states have call successors, (550) [2025-01-09 04:34:27,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 4728 transitions. [2025-01-09 04:34:27,021 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 4728 transitions. Word has length 225 [2025-01-09 04:34:27,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:27,022 INFO L471 AbstractCegarLoop]: Abstraction has 3654 states and 4728 transitions. [2025-01-09 04:34:27,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.166666666666668) internal successors, (187), 6 states have internal predecessors, (187), 3 states have call successors, (12), 2 states have call predecessors, (12), 4 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2025-01-09 04:34:27,022 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 4728 transitions. [2025-01-09 04:34:27,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-09 04:34:27,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:27,024 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:27,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:34:27,024 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:27,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:27,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1983372375, now seen corresponding path program 1 times [2025-01-09 04:34:27,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:27,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408151936] [2025-01-09 04:34:27,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:27,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:27,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 04:34:27,350 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 04:34:27,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:27,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:27,645 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 04:34:27,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:27,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408151936] [2025-01-09 04:34:27,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408151936] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:27,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:27,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:27,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941600124] [2025-01-09 04:34:27,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:27,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:27,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:27,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:27,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:27,647 INFO L87 Difference]: Start difference. First operand 3654 states and 4728 transitions. Second operand has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 04:34:30,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:30,067 INFO L93 Difference]: Finished difference Result 7437 states and 9605 transitions. [2025-01-09 04:34:30,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:30,068 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 228 [2025-01-09 04:34:30,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:30,125 INFO L225 Difference]: With dead ends: 7437 [2025-01-09 04:34:30,125 INFO L226 Difference]: Without dead ends: 3788 [2025-01-09 04:34:30,131 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:30,132 INFO L435 NwaCegarLoop]: 3574 mSDtfsCounter, 4918 mSDsluCounter, 3732 mSDsCounter, 0 mSdLazyCounter, 1852 mSolverCounterSat, 366 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4918 SdHoareTripleChecker+Valid, 7306 SdHoareTripleChecker+Invalid, 2218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 366 IncrementalHoareTripleChecker+Valid, 1852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:30,132 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4918 Valid, 7306 Invalid, 2218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [366 Valid, 1852 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-01-09 04:34:30,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3788 states. [2025-01-09 04:34:30,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3788 to 3652. [2025-01-09 04:34:30,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3652 states, 2984 states have (on average 1.2148123324396782) internal successors, (3625), 3029 states have internal predecessors, (3625), 550 states have call successors, (550), 117 states have call predecessors, (550), 117 states have return successors, (549), 529 states have call predecessors, (549), 549 states have call successors, (549) [2025-01-09 04:34:30,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3652 states to 3652 states and 4724 transitions. [2025-01-09 04:34:30,229 INFO L78 Accepts]: Start accepts. Automaton has 3652 states and 4724 transitions. Word has length 228 [2025-01-09 04:34:30,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:30,230 INFO L471 AbstractCegarLoop]: Abstraction has 3652 states and 4724 transitions. [2025-01-09 04:34:30,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.333333333333332) internal successors, (188), 6 states have internal predecessors, (188), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 04:34:30,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3652 states and 4724 transitions. [2025-01-09 04:34:30,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 04:34:30,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:30,232 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:30,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:34:30,232 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:30,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:30,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1044361007, now seen corresponding path program 1 times [2025-01-09 04:34:30,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:30,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [879265331] [2025-01-09 04:34:30,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:30,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:30,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 04:34:30,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 04:34:30,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:30,548 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:30,850 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 04:34:30,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:30,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [879265331] [2025-01-09 04:34:30,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [879265331] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:30,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:30,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:30,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1488542664] [2025-01-09 04:34:30,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:30,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:30,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:30,852 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:30,852 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:30,852 INFO L87 Difference]: Start difference. First operand 3652 states and 4724 transitions. Second operand has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 04:34:32,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:32,736 INFO L93 Difference]: Finished difference Result 7433 states and 9597 transitions. [2025-01-09 04:34:32,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:32,736 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 229 [2025-01-09 04:34:32,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:32,752 INFO L225 Difference]: With dead ends: 7433 [2025-01-09 04:34:32,756 INFO L226 Difference]: Without dead ends: 3786 [2025-01-09 04:34:32,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:32,768 INFO L435 NwaCegarLoop]: 3480 mSDtfsCounter, 4650 mSDsluCounter, 3574 mSDsCounter, 0 mSdLazyCounter, 1574 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4650 SdHoareTripleChecker+Valid, 7054 SdHoareTripleChecker+Invalid, 1814 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 1574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:32,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4650 Valid, 7054 Invalid, 1814 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 1574 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 04:34:32,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3786 states. [2025-01-09 04:34:32,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3786 to 3648. [2025-01-09 04:34:32,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3648 states, 2982 states have (on average 1.2142857142857142) internal successors, (3621), 3027 states have internal predecessors, (3621), 548 states have call successors, (548), 117 states have call predecessors, (548), 117 states have return successors, (547), 527 states have call predecessors, (547), 547 states have call successors, (547) [2025-01-09 04:34:32,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 4716 transitions. [2025-01-09 04:34:32,933 INFO L78 Accepts]: Start accepts. Automaton has 3648 states and 4716 transitions. Word has length 229 [2025-01-09 04:34:32,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:32,933 INFO L471 AbstractCegarLoop]: Abstraction has 3648 states and 4716 transitions. [2025-01-09 04:34:32,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 04:34:32,933 INFO L276 IsEmpty]: Start isEmpty. Operand 3648 states and 4716 transitions. [2025-01-09 04:34:32,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-01-09 04:34:32,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:32,936 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:32,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:34:32,936 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:32,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:32,936 INFO L85 PathProgramCache]: Analyzing trace with hash 591141807, now seen corresponding path program 1 times [2025-01-09 04:34:32,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:32,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506446985] [2025-01-09 04:34:32,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:32,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:33,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 04:34:33,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 04:34:33,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:33,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 04:34:33,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:33,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506446985] [2025-01-09 04:34:33,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506446985] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:33,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:33,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:33,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796216413] [2025-01-09 04:34:33,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:33,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:33,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:33,576 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:33,576 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:33,576 INFO L87 Difference]: Start difference. First operand 3648 states and 4716 transitions. Second operand has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 04:34:35,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:35,728 INFO L93 Difference]: Finished difference Result 7289 states and 9429 transitions. [2025-01-09 04:34:35,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:35,729 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) Word has length 230 [2025-01-09 04:34:35,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:35,745 INFO L225 Difference]: With dead ends: 7289 [2025-01-09 04:34:35,746 INFO L226 Difference]: Without dead ends: 3646 [2025-01-09 04:34:35,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:35,757 INFO L435 NwaCegarLoop]: 3435 mSDtfsCounter, 5652 mSDsluCounter, 4428 mSDsCounter, 0 mSdLazyCounter, 2052 mSolverCounterSat, 530 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5652 SdHoareTripleChecker+Valid, 7863 SdHoareTripleChecker+Invalid, 2582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 530 IncrementalHoareTripleChecker+Valid, 2052 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:35,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5652 Valid, 7863 Invalid, 2582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [530 Valid, 2052 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 04:34:35,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2025-01-09 04:34:35,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 3644. [2025-01-09 04:34:35,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3644 states, 2980 states have (on average 1.213758389261745) internal successors, (3617), 3025 states have internal predecessors, (3617), 546 states have call successors, (546), 117 states have call predecessors, (546), 117 states have return successors, (545), 525 states have call predecessors, (545), 545 states have call successors, (545) [2025-01-09 04:34:35,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3644 states to 3644 states and 4708 transitions. [2025-01-09 04:34:35,909 INFO L78 Accepts]: Start accepts. Automaton has 3644 states and 4708 transitions. Word has length 230 [2025-01-09 04:34:35,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:35,909 INFO L471 AbstractCegarLoop]: Abstraction has 3644 states and 4708 transitions. [2025-01-09 04:34:35,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.666666666666668) internal successors, (190), 6 states have internal predecessors, (190), 4 states have call successors, (13), 2 states have call predecessors, (13), 4 states have return successors, (11), 4 states have call predecessors, (11), 4 states have call successors, (11) [2025-01-09 04:34:35,910 INFO L276 IsEmpty]: Start isEmpty. Operand 3644 states and 4708 transitions. [2025-01-09 04:34:35,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-01-09 04:34:35,912 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:35,912 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:35,912 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:34:35,912 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:35,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:35,913 INFO L85 PathProgramCache]: Analyzing trace with hash 2125519294, now seen corresponding path program 1 times [2025-01-09 04:34:35,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:35,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318141191] [2025-01-09 04:34:35,913 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:35,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:36,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 04:34:36,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 04:34:36,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:36,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:36,553 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 04:34:36,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:36,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318141191] [2025-01-09 04:34:36,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318141191] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:36,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:36,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:34:36,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37335706] [2025-01-09 04:34:36,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:36,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:36,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:36,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:36,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:34:36,555 INFO L87 Difference]: Start difference. First operand 3644 states and 4708 transitions. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 04:34:37,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:37,417 INFO L93 Difference]: Finished difference Result 7285 states and 9416 transitions. [2025-01-09 04:34:37,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:34:37,417 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) Word has length 230 [2025-01-09 04:34:37,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:37,433 INFO L225 Difference]: With dead ends: 7285 [2025-01-09 04:34:37,434 INFO L226 Difference]: Without dead ends: 3646 [2025-01-09 04:34:37,444 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:37,445 INFO L435 NwaCegarLoop]: 2916 mSDtfsCounter, 1789 mSDsluCounter, 5300 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1789 SdHoareTripleChecker+Valid, 8216 SdHoareTripleChecker+Invalid, 573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:37,445 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1789 Valid, 8216 Invalid, 573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:34:37,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3646 states. [2025-01-09 04:34:37,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3646 to 3644. [2025-01-09 04:34:37,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3644 states, 2980 states have (on average 1.2134228187919462) internal successors, (3616), 3025 states have internal predecessors, (3616), 546 states have call successors, (546), 117 states have call predecessors, (546), 117 states have return successors, (545), 525 states have call predecessors, (545), 545 states have call successors, (545) [2025-01-09 04:34:37,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3644 states to 3644 states and 4707 transitions. [2025-01-09 04:34:37,645 INFO L78 Accepts]: Start accepts. Automaton has 3644 states and 4707 transitions. Word has length 230 [2025-01-09 04:34:37,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:37,646 INFO L471 AbstractCegarLoop]: Abstraction has 3644 states and 4707 transitions. [2025-01-09 04:34:37,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 3 states have call successors, (13), 2 states have call predecessors, (13), 3 states have return successors, (11), 3 states have call predecessors, (11), 3 states have call successors, (11) [2025-01-09 04:34:37,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3644 states and 4707 transitions. [2025-01-09 04:34:37,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-01-09 04:34:37,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:37,649 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:37,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:34:37,650 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:37,654 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:37,654 INFO L85 PathProgramCache]: Analyzing trace with hash 261620017, now seen corresponding path program 1 times [2025-01-09 04:34:37,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:37,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432466235] [2025-01-09 04:34:37,654 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:37,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:37,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-01-09 04:34:38,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-01-09 04:34:38,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:38,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:38,308 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 04:34:38,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:38,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432466235] [2025-01-09 04:34:38,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432466235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:38,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:38,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:34:38,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036464078] [2025-01-09 04:34:38,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:38,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:38,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:38,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:38,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:34:38,310 INFO L87 Difference]: Start difference. First operand 3644 states and 4707 transitions. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 04:34:38,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:38,999 INFO L93 Difference]: Finished difference Result 7417 states and 9562 transitions. [2025-01-09 04:34:38,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:39,000 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 233 [2025-01-09 04:34:39,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:39,015 INFO L225 Difference]: With dead ends: 7417 [2025-01-09 04:34:39,016 INFO L226 Difference]: Without dead ends: 3778 [2025-01-09 04:34:39,026 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:39,026 INFO L435 NwaCegarLoop]: 2996 mSDtfsCounter, 2347 mSDsluCounter, 5647 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2347 SdHoareTripleChecker+Valid, 8643 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:39,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2347 Valid, 8643 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 04:34:39,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3778 states. [2025-01-09 04:34:39,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3778 to 3642. [2025-01-09 04:34:39,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3642 states, 2979 states have (on average 1.213158778113461) internal successors, (3614), 3024 states have internal predecessors, (3614), 545 states have call successors, (545), 117 states have call predecessors, (545), 117 states have return successors, (544), 524 states have call predecessors, (544), 544 states have call successors, (544) [2025-01-09 04:34:39,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3642 states to 3642 states and 4703 transitions. [2025-01-09 04:34:39,155 INFO L78 Accepts]: Start accepts. Automaton has 3642 states and 4703 transitions. Word has length 233 [2025-01-09 04:34:39,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:39,155 INFO L471 AbstractCegarLoop]: Abstraction has 3642 states and 4703 transitions. [2025-01-09 04:34:39,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 states have internal predecessors, (189), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 04:34:39,156 INFO L276 IsEmpty]: Start isEmpty. Operand 3642 states and 4703 transitions. [2025-01-09 04:34:39,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 04:34:39,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:39,158 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:34:39,158 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:34:39,158 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:39,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:39,159 INFO L85 PathProgramCache]: Analyzing trace with hash 638149825, now seen corresponding path program 1 times [2025-01-09 04:34:39,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:39,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768452945] [2025-01-09 04:34:39,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:39,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:39,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 04:34:39,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 04:34:39,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:39,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:39,842 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 04:34:39,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:39,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768452945] [2025-01-09 04:34:39,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768452945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:39,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:39,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:34:39,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237557279] [2025-01-09 04:34:39,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:39,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:39,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:39,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:39,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:34:39,844 INFO L87 Difference]: Start difference. First operand 3642 states and 4703 transitions. Second operand has 5 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12)