./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-mthreaded/rekh_ctm.3-2.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.3-2.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a6fb157ae499b257dadbdfdc38e5d4454494023bad31f4939a5eb0b429ddb260 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 04:33:44,954 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 04:33:45,020 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:45,024 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 04:33:45,028 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 04:33:45,052 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 04:33:45,053 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 04:33:45,053 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 04:33:45,054 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 04:33:45,054 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 04:33:45,054 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 04:33:45,055 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 04:33:45,055 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 04:33:45,055 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 04:33:45,055 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 04:33:45,055 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 04:33:45,056 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 04:33:45,056 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 04:33:45,056 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 04:33:45,056 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 04:33:45,056 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 04:33:45,056 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 04:33:45,056 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 04:33:45,056 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 04:33:45,056 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 04:33:45,056 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 04:33:45,056 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 04:33:45,057 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 04:33:45,057 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 04:33:45,057 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:33:45,057 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:33:45,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:33:45,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:33:45,058 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 04:33:45,058 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 04:33:45,058 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 04:33:45,058 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 04:33:45,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:33:45,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 04:33:45,058 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 04:33:45,058 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 04:33:45,058 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 04:33:45,058 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 04:33:45,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 04:33:45,058 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 04:33:45,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 04:33:45,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 04:33:45,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 04:33:45,059 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 -> a6fb157ae499b257dadbdfdc38e5d4454494023bad31f4939a5eb0b429ddb260 [2025-01-09 04:33:45,313 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 04:33:45,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 04:33:45,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 04:33:45,328 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 04:33:45,329 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 04:33:45,330 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/rekh_ctm.3-2.c [2025-01-09 04:33:46,514 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09869762f/3cec70b4a4df406abd757a28a618512b/FLAG52e547db4 [2025-01-09 04:33:46,926 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 04:33:46,928 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/rekh_ctm.3-2.c [2025-01-09 04:33:46,949 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09869762f/3cec70b4a4df406abd757a28a618512b/FLAG52e547db4 [2025-01-09 04:33:46,966 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/09869762f/3cec70b4a4df406abd757a28a618512b [2025-01-09 04:33:46,968 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 04:33:46,970 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 04:33:46,971 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 04:33:46,971 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 04:33:46,975 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 04:33:46,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:33:46" (1/1) ... [2025-01-09 04:33:46,976 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1298cda7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:46, skipping insertion in model container [2025-01-09 04:33:46,976 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 04:33:46" (1/1) ... [2025-01-09 04:33:47,019 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 04:33:47,162 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.3-2.c[1871,1884] [2025-01-09 04:33:47,518 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:33:47,542 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 04:33:47,550 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"/tmp/aaaa/ctm.bug3.i","-S") [42] [2025-01-09 04:33:47,554 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.3-2.c[1871,1884] [2025-01-09 04:33:47,746 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 04:33:47,779 INFO L204 MainTranslator]: Completed translation [2025-01-09 04:33:47,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:47 WrapperNode [2025-01-09 04:33:47,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 04:33:47,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 04:33:47,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 04:33:47,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 04:33:47,788 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:47" (1/1) ... [2025-01-09 04:33:47,845 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:47" (1/1) ... [2025-01-09 04:33:48,031 INFO L138 Inliner]: procedures = 99, calls = 2816, calls flagged for inlining = 35, calls inlined = 35, statements flattened = 8627 [2025-01-09 04:33:48,032 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 04:33:48,032 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 04:33:48,032 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 04:33:48,032 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 04:33:48,041 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:47" (1/1) ... [2025-01-09 04:33:48,041 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:47" (1/1) ... [2025-01-09 04:33:48,071 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:47" (1/1) ... [2025-01-09 04:33:48,205 INFO L175 MemorySlicer]: Split 2420 memory accesses to 49 slices as follows [2, 80, 86, 37, 37, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 46, 53, 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 446 writes are split as follows [0, 7, 7, 7, 7, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6, 13, 6]. [2025-01-09 04:33:48,205 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:47" (1/1) ... [2025-01-09 04:33:48,205 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:47" (1/1) ... [2025-01-09 04:33:48,298 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:47" (1/1) ... [2025-01-09 04:33:48,311 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:47" (1/1) ... [2025-01-09 04:33:48,330 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:47" (1/1) ... [2025-01-09 04:33:48,383 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:47" (1/1) ... [2025-01-09 04:33:48,407 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:47" (1/1) ... [2025-01-09 04:33:48,439 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 04:33:48,441 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 04:33:48,441 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 04:33:48,441 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 04:33:48,442 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:47" (1/1) ... [2025-01-09 04:33:48,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 04:33:48,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:33:48,468 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:48,471 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:48,485 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_state [2025-01-09 04:33:48,486 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_state [2025-01-09 04:33:48,486 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_state [2025-01-09 04:33:48,486 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_state [2025-01-09 04:33:48,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 04:33:48,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 04:33:48,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 04:33:48,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 04:33:48,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 04:33:48,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 04:33:48,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 04:33:48,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 04:33:48,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 04:33:48,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 04:33:48,486 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 04:33:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 04:33:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 04:33:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 04:33:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 04:33:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 04:33:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 04:33:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 04:33:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 04:33:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#19 [2025-01-09 04:33:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#20 [2025-01-09 04:33:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#21 [2025-01-09 04:33:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#22 [2025-01-09 04:33:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#23 [2025-01-09 04:33:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#24 [2025-01-09 04:33:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#25 [2025-01-09 04:33:48,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#26 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#27 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#28 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#29 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#30 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#31 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#32 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#33 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#34 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#35 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#36 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#37 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#38 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#39 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#40 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#41 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#42 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#43 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#44 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#45 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#46 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#47 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#48 [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_run_nxtbg [2025-01-09 04:33:48,488 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_run_nxtbg [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_set_count [2025-01-09 04:33:48,488 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_set_count [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write___startrek_current_priority [2025-01-09 04:33:48,488 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write___startrek_current_priority [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_input [2025-01-09 04:33:48,488 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_input [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_hyperperiod [2025-01-09 04:33:48,488 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_hyperperiod [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure bg_nxtcolorsensor [2025-01-09 04:33:48,488 INFO L138 BoogieDeclarations]: Found implementation of procedure bg_nxtcolorsensor [2025-01-09 04:33:48,488 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Writer [2025-01-09 04:33:48,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Writer [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_mode [2025-01-09 04:33:48,489 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_mode [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#19 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#20 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#21 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#22 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#23 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#24 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#25 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#26 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#27 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#28 [2025-01-09 04:33:48,489 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#29 [2025-01-09 04:33:48,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#30 [2025-01-09 04:33:48,493 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#31 [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#32 [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#33 [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#34 [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#35 [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#36 [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#37 [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#38 [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#39 [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#40 [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#41 [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#42 [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#43 [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#44 [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#45 [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#46 [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#47 [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#48 [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2025-01-09 04:33:48,494 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_count [2025-01-09 04:33:48,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_count [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_T_state [2025-01-09 04:33:48,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_T_state [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_output [2025-01-09 04:33:48,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_output [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure move_motor [2025-01-09 04:33:48,494 INFO L138 BoogieDeclarations]: Found implementation of procedure move_motor [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_speed [2025-01-09 04:33:48,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_speed [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure nxt_motor_get_count [2025-01-09 04:33:48,494 INFO L138 BoogieDeclarations]: Found implementation of procedure nxt_motor_get_count [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t2 [2025-01-09 04:33:48,494 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t2 [2025-01-09 04:33:48,494 INFO L130 BoogieDeclarations]: Found specification of procedure ecrobot_set_nxtcolorsensor [2025-01-09 04:33:48,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ecrobot_set_nxtcolorsensor [2025-01-09 04:33:48,495 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t3 [2025-01-09 04:33:48,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t3 [2025-01-09 04:33:48,495 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_output [2025-01-09 04:33:48,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_output [2025-01-09 04:33:48,495 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t0 [2025-01-09 04:33:48,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t0 [2025-01-09 04:33:48,495 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_T_count [2025-01-09 04:33:48,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_T_count [2025-01-09 04:33:48,495 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_cs_t1 [2025-01-09 04:33:48,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_cs_t1 [2025-01-09 04:33:48,495 INFO L130 BoogieDeclarations]: Found specification of procedure TerminateTask [2025-01-09 04:33:48,495 INFO L138 BoogieDeclarations]: Found implementation of procedure TerminateTask [2025-01-09 04:33:48,495 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_W_count [2025-01-09 04:33:48,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_W_count [2025-01-09 04:33:48,495 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read___startrek_current_priority [2025-01-09 04:33:48,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read___startrek_current_priority [2025-01-09 04:33:48,495 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_count [2025-01-09 04:33:48,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_count [2025-01-09 04:33:48,495 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_count [2025-01-09 04:33:48,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_count [2025-01-09 04:33:48,495 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_T_speed [2025-01-09 04:33:48,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_T_speed [2025-01-09 04:33:48,495 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_nxtcolorsensor_data_mode [2025-01-09 04:33:48,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_nxtcolorsensor_data_mode [2025-01-09 04:33:48,495 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_threshold [2025-01-09 04:33:48,495 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_threshold [2025-01-09 04:33:48,496 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_need_to_read [2025-01-09 04:33:48,496 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_need_to_read [2025-01-09 04:33:48,496 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_R_state [2025-01-09 04:33:48,496 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_R_state [2025-01-09 04:33:48,496 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Reader [2025-01-09 04:33:48,496 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Reader [2025-01-09 04:33:48,496 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_dir [2025-01-09 04:33:48,496 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_dir [2025-01-09 04:33:48,498 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_W_speed [2025-01-09 04:33:48,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_W_speed [2025-01-09 04:33:48,498 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_input [2025-01-09 04:33:48,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_input [2025-01-09 04:33:48,498 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_R_state [2025-01-09 04:33:48,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_R_state [2025-01-09 04:33:48,498 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_read_need_to_run_nxtbg [2025-01-09 04:33:48,498 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_read_need_to_run_nxtbg [2025-01-09 04:33:48,498 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_W_state [2025-01-09 04:33:48,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_W_state [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_write_R_count [2025-01-09 04:33:48,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_write_R_count [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_TapeMover [2025-01-09 04:33:48,499 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_TapeMover [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#19 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#20 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#21 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#22 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#23 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#24 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#25 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#26 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#27 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#28 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#29 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#30 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#31 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#32 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#33 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#34 [2025-01-09 04:33:48,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#35 [2025-01-09 04:33:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#36 [2025-01-09 04:33:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#37 [2025-01-09 04:33:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#38 [2025-01-09 04:33:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#39 [2025-01-09 04:33:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#40 [2025-01-09 04:33:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#41 [2025-01-09 04:33:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#42 [2025-01-09 04:33:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#43 [2025-01-09 04:33:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#44 [2025-01-09 04:33:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#45 [2025-01-09 04:33:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#46 [2025-01-09 04:33:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#47 [2025-01-09 04:33:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#48 [2025-01-09 04:33:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure __startrek_entry_pt_Controller [2025-01-09 04:33:48,500 INFO L138 BoogieDeclarations]: Found implementation of procedure __startrek_entry_pt_Controller [2025-01-09 04:33:48,500 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 04:33:48,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 04:33:49,066 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 04:33:49,069 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 04:33:59,230 INFO L? ?]: Removed 946 outVars from TransFormulas that were not future-live. [2025-01-09 04:33:59,230 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 04:33:59,287 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 04:33:59,288 INFO L312 CfgBuilder]: Removed 4 assume(true) statements. [2025-01-09 04:33:59,288 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:33:59 BoogieIcfgContainer [2025-01-09 04:33:59,288 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 04:33:59,290 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 04:33:59,290 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 04:33:59,293 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 04:33:59,293 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 04:33:46" (1/3) ... [2025-01-09 04:33:59,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5f34d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:33:59, skipping insertion in model container [2025-01-09 04:33:59,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 04:33:47" (2/3) ... [2025-01-09 04:33:59,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a5f34d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 04:33:59, skipping insertion in model container [2025-01-09 04:33:59,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 04:33:59" (3/3) ... [2025-01-09 04:33:59,297 INFO L128 eAbstractionObserver]: Analyzing ICFG rekh_ctm.3-2.c [2025-01-09 04:33:59,307 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 04:33:59,311 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rekh_ctm.3-2.c that has 45 procedures, 2465 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-01-09 04:33:59,397 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 04:33:59,408 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;@2767abb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 04:33:59,408 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 04:33:59,415 INFO L276 IsEmpty]: Start isEmpty. Operand has 2465 states, 2113 states have (on average 1.4803596781826787) internal successors, (3128), 2137 states have internal predecessors, (3128), 306 states have call successors, (306), 44 states have call predecessors, (306), 44 states have return successors, (306), 296 states have call predecessors, (306), 306 states have call successors, (306) [2025-01-09 04:33:59,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 04:33:59,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:33:59,433 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:59,434 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:33:59,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:33:59,439 INFO L85 PathProgramCache]: Analyzing trace with hash 1131494520, now seen corresponding path program 1 times [2025-01-09 04:33:59,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:33:59,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721646955] [2025-01-09 04:33:59,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:33:59,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:00,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 04:34:00,151 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 04:34:00,155 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:00,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:00,428 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:34:00,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:00,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721646955] [2025-01-09 04:34:00,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721646955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:00,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:00,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 04:34:00,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040281084] [2025-01-09 04:34:00,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:00,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 04:34:00,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:00,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 04:34:00,457 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 04:34:00,464 INFO L87 Difference]: Start difference. First operand has 2465 states, 2113 states have (on average 1.4803596781826787) internal successors, (3128), 2137 states have internal predecessors, (3128), 306 states have call successors, (306), 44 states have call predecessors, (306), 44 states have return successors, (306), 296 states have call predecessors, (306), 306 states have call successors, (306) 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:34:00,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:00,693 INFO L93 Difference]: Finished difference Result 4921 states and 7728 transitions. [2025-01-09 04:34:00,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 04:34:00,696 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:34:00,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:00,728 INFO L225 Difference]: With dead ends: 4921 [2025-01-09 04:34:00,728 INFO L226 Difference]: Without dead ends: 2452 [2025-01-09 04:34:00,759 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:34:00,762 INFO L435 NwaCegarLoop]: 3044 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, 3044 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:34:00,764 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3044 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 04:34:00,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2452 states. [2025-01-09 04:34:00,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2452 to 2452. [2025-01-09 04:34:00,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2452 states, 2101 states have (on average 1.153736316039981) internal successors, (2424), 2125 states have internal predecessors, (2424), 306 states have call successors, (306), 44 states have call predecessors, (306), 44 states have return successors, (305), 295 states have call predecessors, (305), 305 states have call successors, (305) [2025-01-09 04:34:00,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2452 states to 2452 states and 3035 transitions. [2025-01-09 04:34:00,926 INFO L78 Accepts]: Start accepts. Automaton has 2452 states and 3035 transitions. Word has length 148 [2025-01-09 04:34:00,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:00,926 INFO L471 AbstractCegarLoop]: Abstraction has 2452 states and 3035 transitions. [2025-01-09 04:34:00,927 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:34:00,927 INFO L276 IsEmpty]: Start isEmpty. Operand 2452 states and 3035 transitions. [2025-01-09 04:34:00,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 04:34:00,937 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:00,937 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:34:00,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 04:34:00,937 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:00,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:00,938 INFO L85 PathProgramCache]: Analyzing trace with hash -44824461, now seen corresponding path program 1 times [2025-01-09 04:34:00,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:00,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647743450] [2025-01-09 04:34:00,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:00,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:01,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 04:34:01,471 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 04:34:01,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:01,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:02,367 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:34:02,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:02,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647743450] [2025-01-09 04:34:02,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647743450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:02,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:02,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:02,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707205424] [2025-01-09 04:34:02,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:02,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:02,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:02,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:02,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:02,372 INFO L87 Difference]: Start difference. First operand 2452 states and 3035 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:34:05,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:05,730 INFO L93 Difference]: Finished difference Result 5558 states and 6981 transitions. [2025-01-09 04:34:05,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:05,731 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:34:05,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:05,750 INFO L225 Difference]: With dead ends: 5558 [2025-01-09 04:34:05,750 INFO L226 Difference]: Without dead ends: 3111 [2025-01-09 04:34:05,767 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:05,768 INFO L435 NwaCegarLoop]: 3649 mSDtfsCounter, 3885 mSDsluCounter, 5592 mSDsCounter, 0 mSdLazyCounter, 2550 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3885 SdHoareTripleChecker+Valid, 9241 SdHoareTripleChecker+Invalid, 2561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:05,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3885 Valid, 9241 Invalid, 2561 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [11 Valid, 2550 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-09 04:34:05,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3111 states. [2025-01-09 04:34:05,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3111 to 2975. [2025-01-09 04:34:05,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2975 states, 2476 states have (on average 1.1865912762520194) internal successors, (2938), 2506 states have internal predecessors, (2938), 421 states have call successors, (421), 77 states have call predecessors, (421), 77 states have return successors, (420), 406 states have call predecessors, (420), 420 states have call successors, (420) [2025-01-09 04:34:05,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 3779 transitions. [2025-01-09 04:34:05,879 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 3779 transitions. Word has length 208 [2025-01-09 04:34:05,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:05,882 INFO L471 AbstractCegarLoop]: Abstraction has 2975 states and 3779 transitions. [2025-01-09 04:34:05,882 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:34:05,882 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 3779 transitions. [2025-01-09 04:34:05,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 04:34:05,887 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:05,888 INFO L218 NwaCegarLoop]: trace histogram [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:05,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 04:34:05,888 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:05,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:05,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1848427959, now seen corresponding path program 1 times [2025-01-09 04:34:05,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:05,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208054275] [2025-01-09 04:34:05,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:05,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:06,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 04:34:06,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 04:34:06,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:06,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-09 04:34:07,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:07,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208054275] [2025-01-09 04:34:07,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208054275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:07,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:07,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:07,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942797771] [2025-01-09 04:34:07,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:07,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:07,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:07,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:07,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:07,017 INFO L87 Difference]: Start difference. First operand 2975 states and 3779 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:34:10,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:10,018 INFO L93 Difference]: Finished difference Result 6457 states and 8262 transitions. [2025-01-09 04:34:10,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:10,019 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 209 [2025-01-09 04:34:10,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:10,039 INFO L225 Difference]: With dead ends: 6457 [2025-01-09 04:34:10,039 INFO L226 Difference]: Without dead ends: 3487 [2025-01-09 04:34:10,054 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:10,056 INFO L435 NwaCegarLoop]: 3526 mSDtfsCounter, 3728 mSDsluCounter, 5461 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3728 SdHoareTripleChecker+Valid, 8987 SdHoareTripleChecker+Invalid, 2341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:10,057 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3728 Valid, 8987 Invalid, 2341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-09 04:34:10,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3487 states. [2025-01-09 04:34:10,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3487 to 3349. [2025-01-09 04:34:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3349 states, 2752 states have (on average 1.206031976744186) internal successors, (3319), 2791 states have internal predecessors, (3319), 498 states have call successors, (498), 98 states have call predecessors, (498), 98 states have return successors, (497), 479 states have call predecessors, (497), 497 states have call successors, (497) [2025-01-09 04:34:10,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3349 states to 3349 states and 4314 transitions. [2025-01-09 04:34:10,170 INFO L78 Accepts]: Start accepts. Automaton has 3349 states and 4314 transitions. Word has length 209 [2025-01-09 04:34:10,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:10,171 INFO L471 AbstractCegarLoop]: Abstraction has 3349 states and 4314 transitions. [2025-01-09 04:34:10,172 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:34:10,172 INFO L276 IsEmpty]: Start isEmpty. Operand 3349 states and 4314 transitions. [2025-01-09 04:34:10,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2025-01-09 04:34:10,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:10,177 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:34:10,178 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 04:34:10,178 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:10,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:10,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1192451158, now seen corresponding path program 1 times [2025-01-09 04:34:10,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:10,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324074905] [2025-01-09 04:34:10,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:10,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:10,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 205 statements into 1 equivalence classes. [2025-01-09 04:34:10,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 205 of 205 statements. [2025-01-09 04:34:10,769 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:10,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:12,055 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:34:12,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:12,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324074905] [2025-01-09 04:34:12,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324074905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:12,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:12,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:34:12,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948847096] [2025-01-09 04:34:12,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:12,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:12,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:12,058 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:12,058 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:34:12,058 INFO L87 Difference]: Start difference. First operand 3349 states and 4314 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:34:14,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:14,444 INFO L93 Difference]: Finished difference Result 7067 states and 9166 transitions. [2025-01-09 04:34:14,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:14,445 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:34:14,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:14,465 INFO L225 Difference]: With dead ends: 7067 [2025-01-09 04:34:14,465 INFO L226 Difference]: Without dead ends: 3723 [2025-01-09 04:34:14,478 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:34:14,482 INFO L435 NwaCegarLoop]: 3420 mSDtfsCounter, 5685 mSDsluCounter, 2605 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 573 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5685 SdHoareTripleChecker+Valid, 6025 SdHoareTripleChecker+Invalid, 1902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 573 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:14,482 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5685 Valid, 6025 Invalid, 1902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [573 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-09 04:34:14,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3723 states. [2025-01-09 04:34:14,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3723 to 3721. [2025-01-09 04:34:14,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3721 states, 3027 states have (on average 1.222001982160555) internal successors, (3699), 3072 states have internal predecessors, (3699), 575 states have call successors, (575), 118 states have call predecessors, (575), 118 states have return successors, (574), 554 states have call predecessors, (574), 574 states have call successors, (574) [2025-01-09 04:34:14,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3721 states to 3721 states and 4848 transitions. [2025-01-09 04:34:14,612 INFO L78 Accepts]: Start accepts. Automaton has 3721 states and 4848 transitions. Word has length 205 [2025-01-09 04:34:14,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:14,612 INFO L471 AbstractCegarLoop]: Abstraction has 3721 states and 4848 transitions. [2025-01-09 04:34:14,612 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:34:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand 3721 states and 4848 transitions. [2025-01-09 04:34:14,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2025-01-09 04:34:14,616 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:14,616 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:34:14,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 04:34:14,617 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:14,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:14,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1842168293, now seen corresponding path program 1 times [2025-01-09 04:34:14,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:14,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1544918623] [2025-01-09 04:34:14,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:14,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:14,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 04:34:14,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 04:34:14,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:14,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:15,288 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:34:15,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:15,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1544918623] [2025-01-09 04:34:15,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1544918623] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:34:15,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132910882] [2025-01-09 04:34:15,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:15,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:15,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:34:15,293 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:34:15,294 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:34:16,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 208 statements into 1 equivalence classes. [2025-01-09 04:34:16,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 208 of 208 statements. [2025-01-09 04:34:16,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:16,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:16,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 2862 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 04:34:16,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:34:16,448 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:34:16,449 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:34:16,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132910882] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:16,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:34:16,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-01-09 04:34:16,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21682989] [2025-01-09 04:34:16,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:16,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:16,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:16,453 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:16,453 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:16,453 INFO L87 Difference]: Start difference. First operand 3721 states and 4848 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:34:18,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:18,361 INFO L93 Difference]: Finished difference Result 7674 states and 9983 transitions. [2025-01-09 04:34:18,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:18,361 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:34:18,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:18,383 INFO L225 Difference]: With dead ends: 7674 [2025-01-09 04:34:18,383 INFO L226 Difference]: Without dead ends: 3844 [2025-01-09 04:34:18,397 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:34:18,399 INFO L435 NwaCegarLoop]: 3598 mSDtfsCounter, 1465 mSDsluCounter, 6334 mSDsCounter, 0 mSdLazyCounter, 1436 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1465 SdHoareTripleChecker+Valid, 9932 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:18,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1465 Valid, 9932 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1436 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 04:34:18,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3844 states. [2025-01-09 04:34:18,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3844 to 3708. [2025-01-09 04:34:18,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3708 states, 3019 states have (on average 1.2206028486253726) internal successors, (3685), 3064 states have internal predecessors, (3685), 570 states have call successors, (570), 118 states have call predecessors, (570), 118 states have return successors, (569), 549 states have call predecessors, (569), 569 states have call successors, (569) [2025-01-09 04:34:18,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3708 states to 3708 states and 4824 transitions. [2025-01-09 04:34:18,570 INFO L78 Accepts]: Start accepts. Automaton has 3708 states and 4824 transitions. Word has length 208 [2025-01-09 04:34:18,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:18,570 INFO L471 AbstractCegarLoop]: Abstraction has 3708 states and 4824 transitions. [2025-01-09 04:34:18,570 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:34:18,571 INFO L276 IsEmpty]: Start isEmpty. Operand 3708 states and 4824 transitions. [2025-01-09 04:34:18,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-01-09 04:34:18,573 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:18,573 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:34:18,587 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 04:34:18,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:18,774 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:18,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:18,775 INFO L85 PathProgramCache]: Analyzing trace with hash -420345068, now seen corresponding path program 1 times [2025-01-09 04:34:18,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:18,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [4973284] [2025-01-09 04:34:18,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:18,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:19,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 04:34:19,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 04:34:19,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:19,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:19,509 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:34:19,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:19,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [4973284] [2025-01-09 04:34:19,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [4973284] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:34:19,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1670186724] [2025-01-09 04:34:19,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:19,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:19,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:34:19,514 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:34:19,515 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:34:20,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-01-09 04:34:20,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-01-09 04:34:20,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:20,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:20,585 INFO L256 TraceCheckSpWp]: Trace formula consists of 2864 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:34:20,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:34:20,710 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:34:20,710 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:34:20,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1670186724] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:20,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:34:20,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-01-09 04:34:20,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235537372] [2025-01-09 04:34:20,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:20,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:20,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:20,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:20,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:20,713 INFO L87 Difference]: Start difference. First operand 3708 states and 4824 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:34:22,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:22,160 INFO L93 Difference]: Finished difference Result 7605 states and 9878 transitions. [2025-01-09 04:34:22,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:22,161 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:34:22,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:22,181 INFO L225 Difference]: With dead ends: 7605 [2025-01-09 04:34:22,182 INFO L226 Difference]: Without dead ends: 3836 [2025-01-09 04:34:22,201 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:34:22,201 INFO L435 NwaCegarLoop]: 3576 mSDtfsCounter, 1176 mSDsluCounter, 8739 mSDsCounter, 0 mSdLazyCounter, 1220 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1176 SdHoareTripleChecker+Valid, 12315 SdHoareTripleChecker+Invalid, 1222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:22,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1176 Valid, 12315 Invalid, 1222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1220 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:34:22,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3836 states. [2025-01-09 04:34:22,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3836 to 3698. [2025-01-09 04:34:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3698 states, 3013 states have (on average 1.2193826750746763) internal successors, (3674), 3058 states have internal predecessors, (3674), 566 states have call successors, (566), 118 states have call predecessors, (566), 118 states have return successors, (565), 545 states have call predecessors, (565), 565 states have call successors, (565) [2025-01-09 04:34:22,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3698 states to 3698 states and 4805 transitions. [2025-01-09 04:34:22,346 INFO L78 Accepts]: Start accepts. Automaton has 3698 states and 4805 transitions. Word has length 209 [2025-01-09 04:34:22,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:22,346 INFO L471 AbstractCegarLoop]: Abstraction has 3698 states and 4805 transitions. [2025-01-09 04:34:22,347 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:34:22,347 INFO L276 IsEmpty]: Start isEmpty. Operand 3698 states and 4805 transitions. [2025-01-09 04:34:22,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 04:34:22,350 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:22,350 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:34:22,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 04:34:22,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:22,551 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:22,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:22,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1300390143, now seen corresponding path program 1 times [2025-01-09 04:34:22,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:22,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854476648] [2025-01-09 04:34:22,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:22,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:22,863 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 04:34:22,902 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 04:34:22,902 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:22,902 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:23,265 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:34:23,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:23,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854476648] [2025-01-09 04:34:23,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854476648] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:34:23,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [575074128] [2025-01-09 04:34:23,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:23,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:23,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:34:23,268 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:34:23,270 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:34:23,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 04:34:24,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 04:34:24,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:24,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:24,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 2866 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:34:24,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:34:24,336 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:34:24,336 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:34:24,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [575074128] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:24,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:34:24,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-01-09 04:34:24,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251311838] [2025-01-09 04:34:24,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:24,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:24,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:24,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:24,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:24,337 INFO L87 Difference]: Start difference. First operand 3698 states and 4805 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:34:25,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:25,608 INFO L93 Difference]: Finished difference Result 8208 states and 10668 transitions. [2025-01-09 04:34:25,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:25,609 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:34:25,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:25,632 INFO L225 Difference]: With dead ends: 8208 [2025-01-09 04:34:25,632 INFO L226 Difference]: Without dead ends: 4515 [2025-01-09 04:34:25,645 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:34:25,645 INFO L435 NwaCegarLoop]: 3800 mSDtfsCounter, 1741 mSDsluCounter, 6889 mSDsCounter, 0 mSdLazyCounter, 1499 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 10689 SdHoareTripleChecker+Invalid, 1503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:25,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1741 Valid, 10689 Invalid, 1503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1499 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 04:34:25,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4515 states. [2025-01-09 04:34:25,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4515 to 4186. [2025-01-09 04:34:25,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4186 states, 3367 states have (on average 1.236115236115236) internal successors, (4162), 3423 states have internal predecessors, (4162), 676 states have call successors, (676), 141 states have call predecessors, (676), 142 states have return successors, (676), 651 states have call predecessors, (676), 675 states have call successors, (676) [2025-01-09 04:34:25,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 5514 transitions. [2025-01-09 04:34:25,764 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 5514 transitions. Word has length 210 [2025-01-09 04:34:25,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:25,764 INFO L471 AbstractCegarLoop]: Abstraction has 4186 states and 5514 transitions. [2025-01-09 04:34:25,765 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:34:25,765 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 5514 transitions. [2025-01-09 04:34:25,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2025-01-09 04:34:25,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:25,769 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:34:25,781 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:34:25,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:25,970 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:25,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:25,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1386144709, now seen corresponding path program 1 times [2025-01-09 04:34:25,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:25,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036167830] [2025-01-09 04:34:25,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:25,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:26,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 04:34:26,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 04:34:26,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:26,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:26,677 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:34:26,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:26,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036167830] [2025-01-09 04:34:26,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036167830] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:34:26,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181064008] [2025-01-09 04:34:26,677 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:26,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:26,678 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:34:26,679 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:34:26,683 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:34:27,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 210 statements into 1 equivalence classes. [2025-01-09 04:34:27,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 210 of 210 statements. [2025-01-09 04:34:27,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:27,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:27,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 2864 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:34:27,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:34:27,805 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:34:27,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:34:27,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181064008] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:27,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:34:27,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 8 [2025-01-09 04:34:27,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561085697] [2025-01-09 04:34:27,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:27,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:27,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:27,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:27,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 04:34:27,806 INFO L87 Difference]: Start difference. First operand 4186 states and 5514 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:34:29,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:29,217 INFO L93 Difference]: Finished difference Result 8369 states and 11032 transitions. [2025-01-09 04:34:29,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:29,217 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:34:29,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:29,250 INFO L225 Difference]: With dead ends: 8369 [2025-01-09 04:34:29,250 INFO L226 Difference]: Without dead ends: 4188 [2025-01-09 04:34:29,265 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:34:29,265 INFO L435 NwaCegarLoop]: 2943 mSDtfsCounter, 1062 mSDsluCounter, 5749 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 8692 SdHoareTripleChecker+Invalid, 1030 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:29,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 8692 Invalid, 1030 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 04:34:29,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4188 states. [2025-01-09 04:34:29,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4188 to 4186. [2025-01-09 04:34:29,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4186 states, 3367 states have (on average 1.235818235818236) internal successors, (4161), 3423 states have internal predecessors, (4161), 676 states have call successors, (676), 141 states have call predecessors, (676), 142 states have return successors, (676), 651 states have call predecessors, (676), 675 states have call successors, (676) [2025-01-09 04:34:29,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 5513 transitions. [2025-01-09 04:34:29,397 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 5513 transitions. Word has length 210 [2025-01-09 04:34:29,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:29,398 INFO L471 AbstractCegarLoop]: Abstraction has 4186 states and 5513 transitions. [2025-01-09 04:34:29,399 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:34:29,399 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 5513 transitions. [2025-01-09 04:34:29,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 04:34:29,403 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:29,403 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:29,417 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 04:34:29,604 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,SelfDestructingSolverStorable7 [2025-01-09 04:34:29,604 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:29,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:29,605 INFO L85 PathProgramCache]: Analyzing trace with hash 2009399391, now seen corresponding path program 1 times [2025-01-09 04:34:29,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:29,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036354188] [2025-01-09 04:34:29,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:29,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:29,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 04:34:29,917 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 04:34:29,917 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:29,917 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:30,353 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:30,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:30,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036354188] [2025-01-09 04:34:30,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036354188] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:30,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:30,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:30,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168616926] [2025-01-09 04:34:30,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:30,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:30,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:30,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:30,355 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:30,355 INFO L87 Difference]: Start difference. First operand 4186 states and 5513 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:32,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:32,221 INFO L93 Difference]: Finished difference Result 7873 states and 10305 transitions. [2025-01-09 04:34:32,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:32,221 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:32,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:32,238 INFO L225 Difference]: With dead ends: 7873 [2025-01-09 04:34:32,238 INFO L226 Difference]: Without dead ends: 3692 [2025-01-09 04:34:32,252 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:32,252 INFO L435 NwaCegarLoop]: 3490 mSDtfsCounter, 6660 mSDsluCounter, 2645 mSDsCounter, 0 mSdLazyCounter, 1393 mSolverCounterSat, 849 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6660 SdHoareTripleChecker+Valid, 6135 SdHoareTripleChecker+Invalid, 2242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 849 IncrementalHoareTripleChecker+Valid, 1393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:32,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6660 Valid, 6135 Invalid, 2242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [849 Valid, 1393 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 04:34:32,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3692 states. [2025-01-09 04:34:32,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3692 to 3690. [2025-01-09 04:34:32,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3690 states, 3008 states have (on average 1.217752659574468) internal successors, (3663), 3053 states have internal predecessors, (3663), 563 states have call successors, (563), 118 states have call predecessors, (563), 118 states have return successors, (562), 542 states have call predecessors, (562), 562 states have call successors, (562) [2025-01-09 04:34:32,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3690 states to 3690 states and 4788 transitions. [2025-01-09 04:34:32,348 INFO L78 Accepts]: Start accepts. Automaton has 3690 states and 4788 transitions. Word has length 220 [2025-01-09 04:34:32,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:32,348 INFO L471 AbstractCegarLoop]: Abstraction has 3690 states and 4788 transitions. [2025-01-09 04:34:32,348 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:32,348 INFO L276 IsEmpty]: Start isEmpty. Operand 3690 states and 4788 transitions. [2025-01-09 04:34:32,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 04:34:32,351 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:32,351 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:32,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 04:34:32,351 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:32,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:32,351 INFO L85 PathProgramCache]: Analyzing trace with hash 240115867, now seen corresponding path program 1 times [2025-01-09 04:34:32,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:32,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895630817] [2025-01-09 04:34:32,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:32,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:32,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 04:34:32,690 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 04:34:32,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:32,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:33,017 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:33,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:33,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895630817] [2025-01-09 04:34:33,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895630817] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 04:34:33,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [260545416] [2025-01-09 04:34:33,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:33,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 04:34:33,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 04:34:33,019 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:33,021 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:33,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 04:34:34,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 04:34:34,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:34,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:34,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 2892 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 04:34:34,069 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 04:34:34,157 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:34,158 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 04:34:34,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [260545416] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:34,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 04:34:34,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2025-01-09 04:34:34,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152934376] [2025-01-09 04:34:34,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:34,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:34,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:34,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:34,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-09 04:34:34,160 INFO L87 Difference]: Start difference. First operand 3690 states and 4788 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:35,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:35,684 INFO L93 Difference]: Finished difference Result 7375 states and 9577 transitions. [2025-01-09 04:34:35,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:35,684 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:35,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:35,699 INFO L225 Difference]: With dead ends: 7375 [2025-01-09 04:34:35,699 INFO L226 Difference]: Without dead ends: 3690 [2025-01-09 04:34:35,710 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:35,710 INFO L435 NwaCegarLoop]: 3060 mSDtfsCounter, 4522 mSDsluCounter, 2937 mSDsCounter, 0 mSdLazyCounter, 991 mSolverCounterSat, 543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4522 SdHoareTripleChecker+Valid, 5997 SdHoareTripleChecker+Invalid, 1534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 543 IncrementalHoareTripleChecker+Valid, 991 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:35,710 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4522 Valid, 5997 Invalid, 1534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [543 Valid, 991 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 04:34:35,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2025-01-09 04:34:35,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 3688. [2025-01-09 04:34:35,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3688 states, 3007 states have (on average 1.2174925174592617) internal successors, (3661), 3052 states have internal predecessors, (3661), 562 states have call successors, (562), 118 states have call predecessors, (562), 118 states have return successors, (561), 541 states have call predecessors, (561), 561 states have call successors, (561) [2025-01-09 04:34:35,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 4784 transitions. [2025-01-09 04:34:35,812 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 4784 transitions. Word has length 220 [2025-01-09 04:34:35,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:35,813 INFO L471 AbstractCegarLoop]: Abstraction has 3688 states and 4784 transitions. [2025-01-09 04:34:35,813 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:35,813 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 4784 transitions. [2025-01-09 04:34:35,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-01-09 04:34:35,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:35,816 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:35,829 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 04:34:36,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 04:34:36,017 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:36,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:36,018 INFO L85 PathProgramCache]: Analyzing trace with hash -708388119, now seen corresponding path program 1 times [2025-01-09 04:34:36,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:36,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143867680] [2025-01-09 04:34:36,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:36,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:36,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 220 statements into 1 equivalence classes. [2025-01-09 04:34:36,322 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 220 of 220 statements. [2025-01-09 04:34:36,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:36,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:36,656 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:36,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:36,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143867680] [2025-01-09 04:34:36,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143867680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:36,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:36,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:36,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591391365] [2025-01-09 04:34:36,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:36,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:36,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:36,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:36,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:36,658 INFO L87 Difference]: Start difference. First operand 3688 states and 4784 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:38,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:38,620 INFO L93 Difference]: Finished difference Result 7373 states and 9571 transitions. [2025-01-09 04:34:38,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:38,620 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:38,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:38,637 INFO L225 Difference]: With dead ends: 7373 [2025-01-09 04:34:38,637 INFO L226 Difference]: Without dead ends: 3690 [2025-01-09 04:34:38,649 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:38,651 INFO L435 NwaCegarLoop]: 3392 mSDtfsCounter, 3626 mSDsluCounter, 5178 mSDsCounter, 0 mSdLazyCounter, 2370 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3626 SdHoareTripleChecker+Valid, 8570 SdHoareTripleChecker+Invalid, 2379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:38,651 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3626 Valid, 8570 Invalid, 2379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2370 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 04:34:38,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3690 states. [2025-01-09 04:34:38,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3690 to 3688. [2025-01-09 04:34:38,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3688 states, 3007 states have (on average 1.217159960093116) internal successors, (3660), 3052 states have internal predecessors, (3660), 562 states have call successors, (562), 118 states have call predecessors, (562), 118 states have return successors, (561), 541 states have call predecessors, (561), 561 states have call successors, (561) [2025-01-09 04:34:38,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3688 states to 3688 states and 4783 transitions. [2025-01-09 04:34:38,761 INFO L78 Accepts]: Start accepts. Automaton has 3688 states and 4783 transitions. Word has length 220 [2025-01-09 04:34:38,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:38,761 INFO L471 AbstractCegarLoop]: Abstraction has 3688 states and 4783 transitions. [2025-01-09 04:34:38,762 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:38,762 INFO L276 IsEmpty]: Start isEmpty. Operand 3688 states and 4783 transitions. [2025-01-09 04:34:38,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2025-01-09 04:34:38,764 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:38,764 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:38,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 04:34:38,764 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:38,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:38,765 INFO L85 PathProgramCache]: Analyzing trace with hash 734667156, now seen corresponding path program 1 times [2025-01-09 04:34:38,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:38,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054265930] [2025-01-09 04:34:38,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:38,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:39,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 223 statements into 1 equivalence classes. [2025-01-09 04:34:39,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 223 of 223 statements. [2025-01-09 04:34:39,082 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:39,082 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:39,450 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:39,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:39,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054265930] [2025-01-09 04:34:39,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054265930] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:39,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:39,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:39,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270747874] [2025-01-09 04:34:39,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:39,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:39,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:39,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:39,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:39,451 INFO L87 Difference]: Start difference. First operand 3688 states and 4783 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:41,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:41,492 INFO L93 Difference]: Finished difference Result 7505 states and 9717 transitions. [2025-01-09 04:34:41,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:41,493 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:41,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:41,509 INFO L225 Difference]: With dead ends: 7505 [2025-01-09 04:34:41,509 INFO L226 Difference]: Without dead ends: 3822 [2025-01-09 04:34:41,522 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:41,523 INFO L435 NwaCegarLoop]: 3625 mSDtfsCounter, 3877 mSDsluCounter, 5565 mSDsCounter, 0 mSdLazyCounter, 2520 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3877 SdHoareTripleChecker+Valid, 9190 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 2520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:41,523 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3877 Valid, 9190 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 2520 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 04:34:41,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3822 states. [2025-01-09 04:34:41,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3822 to 3686. [2025-01-09 04:34:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3686 states, 3006 states have (on average 1.2168995342648037) internal successors, (3658), 3051 states have internal predecessors, (3658), 561 states have call successors, (561), 118 states have call predecessors, (561), 118 states have return successors, (560), 540 states have call predecessors, (560), 560 states have call successors, (560) [2025-01-09 04:34:41,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3686 states to 3686 states and 4779 transitions. [2025-01-09 04:34:41,632 INFO L78 Accepts]: Start accepts. Automaton has 3686 states and 4779 transitions. Word has length 223 [2025-01-09 04:34:41,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:41,632 INFO L471 AbstractCegarLoop]: Abstraction has 3686 states and 4779 transitions. [2025-01-09 04:34:41,632 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:41,633 INFO L276 IsEmpty]: Start isEmpty. Operand 3686 states and 4779 transitions. [2025-01-09 04:34:41,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-01-09 04:34:41,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:41,635 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:41,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 04:34:41,635 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:41,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:41,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1070272817, now seen corresponding path program 1 times [2025-01-09 04:34:41,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:41,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588449778] [2025-01-09 04:34:41,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:41,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:41,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-01-09 04:34:41,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-01-09 04:34:41,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:41,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:42,283 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:42,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:42,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588449778] [2025-01-09 04:34:42,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588449778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:42,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:42,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:42,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360666709] [2025-01-09 04:34:42,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:42,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:42,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:42,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:42,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:42,286 INFO L87 Difference]: Start difference. First operand 3686 states and 4779 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:44,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:44,126 INFO L93 Difference]: Finished difference Result 7501 states and 9709 transitions. [2025-01-09 04:34:44,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:44,127 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:44,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:44,142 INFO L225 Difference]: With dead ends: 7501 [2025-01-09 04:34:44,142 INFO L226 Difference]: Without dead ends: 3820 [2025-01-09 04:34:44,155 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:44,156 INFO L435 NwaCegarLoop]: 3503 mSDtfsCounter, 6683 mSDsluCounter, 2715 mSDsCounter, 0 mSdLazyCounter, 1278 mSolverCounterSat, 789 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6683 SdHoareTripleChecker+Valid, 6218 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 789 IncrementalHoareTripleChecker+Valid, 1278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:44,156 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6683 Valid, 6218 Invalid, 2067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [789 Valid, 1278 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 04:34:44,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3820 states. [2025-01-09 04:34:44,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3820 to 3682. [2025-01-09 04:34:44,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3682 states, 3004 states have (on average 1.2163781624500665) internal successors, (3654), 3049 states have internal predecessors, (3654), 559 states have call successors, (559), 118 states have call predecessors, (559), 118 states have return successors, (558), 538 states have call predecessors, (558), 558 states have call successors, (558) [2025-01-09 04:34:44,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3682 states to 3682 states and 4771 transitions. [2025-01-09 04:34:44,256 INFO L78 Accepts]: Start accepts. Automaton has 3682 states and 4771 transitions. Word has length 224 [2025-01-09 04:34:44,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:44,257 INFO L471 AbstractCegarLoop]: Abstraction has 3682 states and 4771 transitions. [2025-01-09 04:34:44,257 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:44,257 INFO L276 IsEmpty]: Start isEmpty. Operand 3682 states and 4771 transitions. [2025-01-09 04:34:44,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-09 04:34:44,260 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:44,260 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, 1] [2025-01-09 04:34:44,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 04:34:44,260 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:44,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:44,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1484668306, now seen corresponding path program 1 times [2025-01-09 04:34:44,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:44,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251700627] [2025-01-09 04:34:44,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:44,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:44,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-09 04:34:44,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-09 04:34:44,615 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:44,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:45,044 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:45,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:45,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251700627] [2025-01-09 04:34:45,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251700627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:45,044 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:45,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:45,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378269584] [2025-01-09 04:34:45,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:45,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:45,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:45,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:45,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:45,045 INFO L87 Difference]: Start difference. First operand 3682 states and 4771 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, (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:47,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:47,189 INFO L93 Difference]: Finished difference Result 7357 states and 9541 transitions. [2025-01-09 04:34:47,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:47,190 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, (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 225 [2025-01-09 04:34:47,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:47,211 INFO L225 Difference]: With dead ends: 7357 [2025-01-09 04:34:47,211 INFO L226 Difference]: Without dead ends: 3680 [2025-01-09 04:34:47,225 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:47,225 INFO L435 NwaCegarLoop]: 3477 mSDtfsCounter, 5728 mSDsluCounter, 4473 mSDsCounter, 0 mSdLazyCounter, 2094 mSolverCounterSat, 543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5728 SdHoareTripleChecker+Valid, 7950 SdHoareTripleChecker+Invalid, 2637 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 543 IncrementalHoareTripleChecker+Valid, 2094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:47,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5728 Valid, 7950 Invalid, 2637 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [543 Valid, 2094 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 04:34:47,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2025-01-09 04:34:47,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3678. [2025-01-09 04:34:47,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3678 states, 3002 states have (on average 1.2158560959360427) internal successors, (3650), 3047 states have internal predecessors, (3650), 557 states have call successors, (557), 118 states have call predecessors, (557), 118 states have return successors, (556), 536 states have call predecessors, (556), 556 states have call successors, (556) [2025-01-09 04:34:47,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 4763 transitions. [2025-01-09 04:34:47,330 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 4763 transitions. Word has length 225 [2025-01-09 04:34:47,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:47,331 INFO L471 AbstractCegarLoop]: Abstraction has 3678 states and 4763 transitions. [2025-01-09 04:34:47,331 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, (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:47,331 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 4763 transitions. [2025-01-09 04:34:47,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-09 04:34:47,333 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:47,333 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:47,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 04:34:47,334 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:47,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:47,334 INFO L85 PathProgramCache]: Analyzing trace with hash 1787915468, now seen corresponding path program 1 times [2025-01-09 04:34:47,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:47,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402180704] [2025-01-09 04:34:47,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:47,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:47,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-09 04:34:47,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-09 04:34:47,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:47,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:48,050 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:48,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:48,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402180704] [2025-01-09 04:34:48,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402180704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:48,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:48,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:48,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1691069288] [2025-01-09 04:34:48,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:48,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:48,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:48,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:48,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:48,052 INFO L87 Difference]: Start difference. First operand 3678 states and 4763 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:49,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:49,848 INFO L93 Difference]: Finished difference Result 7353 states and 9529 transitions. [2025-01-09 04:34:49,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:34:49,849 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:49,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:49,863 INFO L225 Difference]: With dead ends: 7353 [2025-01-09 04:34:49,863 INFO L226 Difference]: Without dead ends: 3680 [2025-01-09 04:34:49,876 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:49,876 INFO L435 NwaCegarLoop]: 3371 mSDtfsCounter, 6425 mSDsluCounter, 2574 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 794 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6425 SdHoareTripleChecker+Valid, 5945 SdHoareTripleChecker+Invalid, 2101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 794 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:49,876 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6425 Valid, 5945 Invalid, 2101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [794 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 04:34:49,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3680 states. [2025-01-09 04:34:49,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3680 to 3678. [2025-01-09 04:34:49,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3678 states, 3002 states have (on average 1.215522984676882) internal successors, (3649), 3047 states have internal predecessors, (3649), 557 states have call successors, (557), 118 states have call predecessors, (557), 118 states have return successors, (556), 536 states have call predecessors, (556), 556 states have call successors, (556) [2025-01-09 04:34:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3678 states to 3678 states and 4762 transitions. [2025-01-09 04:34:49,976 INFO L78 Accepts]: Start accepts. Automaton has 3678 states and 4762 transitions. Word has length 225 [2025-01-09 04:34:49,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:49,977 INFO L471 AbstractCegarLoop]: Abstraction has 3678 states and 4762 transitions. [2025-01-09 04:34:49,977 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:49,977 INFO L276 IsEmpty]: Start isEmpty. Operand 3678 states and 4762 transitions. [2025-01-09 04:34:49,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-01-09 04:34:49,979 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:49,979 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:49,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 04:34:49,979 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:49,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:49,980 INFO L85 PathProgramCache]: Analyzing trace with hash 1565954151, now seen corresponding path program 1 times [2025-01-09 04:34:49,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:49,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623081310] [2025-01-09 04:34:49,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:49,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:50,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-01-09 04:34:50,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-01-09 04:34:50,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:50,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:50,571 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:50,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:50,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623081310] [2025-01-09 04:34:50,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623081310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:50,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:50,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:50,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673124858] [2025-01-09 04:34:50,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:50,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:50,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:50,572 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:50,572 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:50,572 INFO L87 Difference]: Start difference. First operand 3678 states and 4762 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:52,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:52,326 INFO L93 Difference]: Finished difference Result 7485 states and 9675 transitions. [2025-01-09 04:34:52,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:52,326 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:52,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:52,344 INFO L225 Difference]: With dead ends: 7485 [2025-01-09 04:34:52,344 INFO L226 Difference]: Without dead ends: 3812 [2025-01-09 04:34:52,359 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:52,360 INFO L435 NwaCegarLoop]: 3604 mSDtfsCounter, 5789 mSDsluCounter, 4562 mSDsCounter, 0 mSdLazyCounter, 2021 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5789 SdHoareTripleChecker+Valid, 8166 SdHoareTripleChecker+Invalid, 2500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 2021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:52,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5789 Valid, 8166 Invalid, 2500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 2021 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 04:34:52,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3812 states. [2025-01-09 04:34:52,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3812 to 3676. [2025-01-09 04:34:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3676 states, 3001 states have (on average 1.2152615794735089) internal successors, (3647), 3046 states have internal predecessors, (3647), 556 states have call successors, (556), 118 states have call predecessors, (556), 118 states have return successors, (555), 535 states have call predecessors, (555), 555 states have call successors, (555) [2025-01-09 04:34:52,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3676 states to 3676 states and 4758 transitions. [2025-01-09 04:34:52,461 INFO L78 Accepts]: Start accepts. Automaton has 3676 states and 4758 transitions. Word has length 228 [2025-01-09 04:34:52,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:52,463 INFO L471 AbstractCegarLoop]: Abstraction has 3676 states and 4758 transitions. [2025-01-09 04:34:52,463 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:52,463 INFO L276 IsEmpty]: Start isEmpty. Operand 3676 states and 4758 transitions. [2025-01-09 04:34:52,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-09 04:34:52,464 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:52,465 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:52,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 04:34:52,465 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:52,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:52,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1521085613, now seen corresponding path program 1 times [2025-01-09 04:34:52,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:52,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537771993] [2025-01-09 04:34:52,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:52,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:52,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-09 04:34:52,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-09 04:34:52,772 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:52,772 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:53,116 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:53,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:53,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537771993] [2025-01-09 04:34:53,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537771993] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:53,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:53,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:53,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17356806] [2025-01-09 04:34:53,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:53,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:53,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:53,117 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:53,117 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:53,117 INFO L87 Difference]: Start difference. First operand 3676 states and 4758 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:55,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:55,025 INFO L93 Difference]: Finished difference Result 7481 states and 9667 transitions. [2025-01-09 04:34:55,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:55,025 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:55,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:55,042 INFO L225 Difference]: With dead ends: 7481 [2025-01-09 04:34:55,042 INFO L226 Difference]: Without dead ends: 3810 [2025-01-09 04:34:55,055 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:55,056 INFO L435 NwaCegarLoop]: 3495 mSDtfsCounter, 4667 mSDsluCounter, 3585 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 244 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4667 SdHoareTripleChecker+Valid, 7080 SdHoareTripleChecker+Invalid, 1828 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 244 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:55,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4667 Valid, 7080 Invalid, 1828 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [244 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-01-09 04:34:55,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3810 states. [2025-01-09 04:34:55,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3810 to 3672. [2025-01-09 04:34:55,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3672 states, 2999 states have (on average 1.2147382460820273) internal successors, (3643), 3044 states have internal predecessors, (3643), 554 states have call successors, (554), 118 states have call predecessors, (554), 118 states have return successors, (553), 533 states have call predecessors, (553), 553 states have call successors, (553) [2025-01-09 04:34:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 4750 transitions. [2025-01-09 04:34:55,163 INFO L78 Accepts]: Start accepts. Automaton has 3672 states and 4750 transitions. Word has length 229 [2025-01-09 04:34:55,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:55,164 INFO L471 AbstractCegarLoop]: Abstraction has 3672 states and 4750 transitions. [2025-01-09 04:34:55,164 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:55,164 INFO L276 IsEmpty]: Start isEmpty. Operand 3672 states and 4750 transitions. [2025-01-09 04:34:55,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-01-09 04:34:55,165 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:55,166 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:55,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 04:34:55,166 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:55,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:55,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1573884883, now seen corresponding path program 1 times [2025-01-09 04:34:55,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:55,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168224582] [2025-01-09 04:34:55,167 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:55,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:55,444 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 04:34:55,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 04:34:55,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:55,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:55,841 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:55,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:55,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168224582] [2025-01-09 04:34:55,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168224582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:55,841 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:55,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 04:34:55,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171380528] [2025-01-09 04:34:55,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:55,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 04:34:55,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:55,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 04:34:55,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-09 04:34:55,842 INFO L87 Difference]: Start difference. First operand 3672 states and 4750 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:57,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:57,944 INFO L93 Difference]: Finished difference Result 7337 states and 9499 transitions. [2025-01-09 04:34:57,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 04:34:57,945 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:57,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:57,960 INFO L225 Difference]: With dead ends: 7337 [2025-01-09 04:34:57,960 INFO L226 Difference]: Without dead ends: 3670 [2025-01-09 04:34:57,973 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:57,974 INFO L435 NwaCegarLoop]: 3469 mSDtfsCounter, 6624 mSDsluCounter, 2633 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 836 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6624 SdHoareTripleChecker+Valid, 6102 SdHoareTripleChecker+Invalid, 2222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 836 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:57,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6624 Valid, 6102 Invalid, 2222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [836 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-09 04:34:57,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2025-01-09 04:34:58,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3668. [2025-01-09 04:34:58,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3668 states, 2997 states have (on average 1.2142142142142143) internal successors, (3639), 3042 states have internal predecessors, (3639), 552 states have call successors, (552), 118 states have call predecessors, (552), 118 states have return successors, (551), 531 states have call predecessors, (551), 551 states have call successors, (551) [2025-01-09 04:34:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 4742 transitions. [2025-01-09 04:34:58,078 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 4742 transitions. Word has length 230 [2025-01-09 04:34:58,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:58,078 INFO L471 AbstractCegarLoop]: Abstraction has 3668 states and 4742 transitions. [2025-01-09 04:34:58,078 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:58,078 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 4742 transitions. [2025-01-09 04:34:58,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-01-09 04:34:58,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:58,080 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:58,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 04:34:58,080 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:58,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:58,081 INFO L85 PathProgramCache]: Analyzing trace with hash 667088038, now seen corresponding path program 1 times [2025-01-09 04:34:58,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:58,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674467535] [2025-01-09 04:34:58,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:58,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:58,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-01-09 04:34:58,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-01-09 04:34:58,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:58,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:58,732 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:58,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:58,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674467535] [2025-01-09 04:34:58,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674467535] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:58,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:58,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:34:58,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547466520] [2025-01-09 04:34:58,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:58,733 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:58,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:58,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:58,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:34:58,734 INFO L87 Difference]: Start difference. First operand 3668 states and 4742 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:59,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:34:59,292 INFO L93 Difference]: Finished difference Result 7333 states and 9486 transitions. [2025-01-09 04:34:59,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 04:34:59,293 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:59,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:34:59,307 INFO L225 Difference]: With dead ends: 7333 [2025-01-09 04:34:59,307 INFO L226 Difference]: Without dead ends: 3670 [2025-01-09 04:34:59,319 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:59,319 INFO L435 NwaCegarLoop]: 2927 mSDtfsCounter, 1022 mSDsluCounter, 7695 mSDsCounter, 0 mSdLazyCounter, 529 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1022 SdHoareTripleChecker+Valid, 10622 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 529 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 04:34:59,319 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1022 Valid, 10622 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 529 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 04:34:59,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3670 states. [2025-01-09 04:34:59,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3670 to 3668. [2025-01-09 04:34:59,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3668 states, 2997 states have (on average 1.2138805472138805) internal successors, (3638), 3042 states have internal predecessors, (3638), 552 states have call successors, (552), 118 states have call predecessors, (552), 118 states have return successors, (551), 531 states have call predecessors, (551), 551 states have call successors, (551) [2025-01-09 04:34:59,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3668 states to 3668 states and 4741 transitions. [2025-01-09 04:34:59,411 INFO L78 Accepts]: Start accepts. Automaton has 3668 states and 4741 transitions. Word has length 230 [2025-01-09 04:34:59,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:34:59,411 INFO L471 AbstractCegarLoop]: Abstraction has 3668 states and 4741 transitions. [2025-01-09 04:34:59,411 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:59,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3668 states and 4741 transitions. [2025-01-09 04:34:59,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-01-09 04:34:59,413 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:34:59,413 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:59,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 04:34:59,413 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:34:59,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:34:59,414 INFO L85 PathProgramCache]: Analyzing trace with hash 52218023, now seen corresponding path program 1 times [2025-01-09 04:34:59,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:34:59,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395160450] [2025-01-09 04:34:59,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:34:59,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:34:59,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-01-09 04:34:59,704 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-01-09 04:34:59,704 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:34:59,704 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:34:59,959 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:59,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:34:59,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395160450] [2025-01-09 04:34:59,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1395160450] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:34:59,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:34:59,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:34:59,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460102039] [2025-01-09 04:34:59,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:34:59,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:34:59,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:34:59,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:34:59,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:34:59,960 INFO L87 Difference]: Start difference. First operand 3668 states and 4741 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:35:00,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:00,886 INFO L93 Difference]: Finished difference Result 7465 states and 9632 transitions. [2025-01-09 04:35:00,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:35:00,890 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:35:00,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:00,906 INFO L225 Difference]: With dead ends: 7465 [2025-01-09 04:35:00,907 INFO L226 Difference]: Without dead ends: 3802 [2025-01-09 04:35:00,916 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:35:00,917 INFO L435 NwaCegarLoop]: 3007 mSDtfsCounter, 4307 mSDsluCounter, 4330 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4307 SdHoareTripleChecker+Valid, 7337 SdHoareTripleChecker+Invalid, 909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:00,917 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4307 Valid, 7337 Invalid, 909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 04:35:00,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2025-01-09 04:35:00,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 3666. [2025-01-09 04:35:00,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 2996 states have (on average 1.213618157543391) internal successors, (3636), 3041 states have internal predecessors, (3636), 551 states have call successors, (551), 118 states have call predecessors, (551), 118 states have return successors, (550), 530 states have call predecessors, (550), 550 states have call successors, (550) [2025-01-09 04:35:01,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 4737 transitions. [2025-01-09 04:35:01,013 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 4737 transitions. Word has length 233 [2025-01-09 04:35:01,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:01,014 INFO L471 AbstractCegarLoop]: Abstraction has 3666 states and 4737 transitions. [2025-01-09 04:35:01,014 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:35:01,014 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 4737 transitions. [2025-01-09 04:35:01,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-09 04:35:01,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:01,016 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:35:01,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 04:35:01,016 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:01,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:01,017 INFO L85 PathProgramCache]: Analyzing trace with hash 1421792526, now seen corresponding path program 1 times [2025-01-09 04:35:01,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:01,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532959461] [2025-01-09 04:35:01,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:01,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 04:35:01,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-09 04:35:01,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-09 04:35:01,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 04:35:01,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 04:35:01,618 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:35:01,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 04:35:01,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532959461] [2025-01-09 04:35:01,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532959461] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 04:35:01,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 04:35:01,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 04:35:01,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772189432] [2025-01-09 04:35:01,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 04:35:01,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 04:35:01,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 04:35:01,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 04:35:01,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 04:35:01,619 INFO L87 Difference]: Start difference. First operand 3666 states and 4737 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) [2025-01-09 04:35:02,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 04:35:02,533 INFO L93 Difference]: Finished difference Result 7463 states and 9625 transitions. [2025-01-09 04:35:02,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 04:35:02,534 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, (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 234 [2025-01-09 04:35:02,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 04:35:02,551 INFO L225 Difference]: With dead ends: 7463 [2025-01-09 04:35:02,552 INFO L226 Difference]: Without dead ends: 3802 [2025-01-09 04:35:02,564 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:35:02,564 INFO L435 NwaCegarLoop]: 2908 mSDtfsCounter, 4502 mSDsluCounter, 4010 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 539 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4502 SdHoareTripleChecker+Valid, 6918 SdHoareTripleChecker+Invalid, 959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 539 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 04:35:02,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4502 Valid, 6918 Invalid, 959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [539 Valid, 420 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 04:35:02,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3802 states. [2025-01-09 04:35:02,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3802 to 3664. [2025-01-09 04:35:02,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3664 states, 2995 states have (on average 1.213355592654424) internal successors, (3634), 3040 states have internal predecessors, (3634), 550 states have call successors, (550), 118 states have call predecessors, (550), 118 states have return successors, (549), 529 states have call predecessors, (549), 549 states have call successors, (549) [2025-01-09 04:35:02,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3664 states to 3664 states and 4733 transitions. [2025-01-09 04:35:02,714 INFO L78 Accepts]: Start accepts. Automaton has 3664 states and 4733 transitions. Word has length 234 [2025-01-09 04:35:02,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 04:35:02,715 INFO L471 AbstractCegarLoop]: Abstraction has 3664 states and 4733 transitions. [2025-01-09 04:35:02,715 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, (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:35:02,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3664 states and 4733 transitions. [2025-01-09 04:35:02,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-01-09 04:35:02,717 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 04:35:02,717 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, 1] [2025-01-09 04:35:02,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 04:35:02,717 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 04:35:02,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 04:35:02,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1042533133, now seen corresponding path program 1 times [2025-01-09 04:35:02,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 04:35:02,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693942471] [2025-01-09 04:35:02,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 04:35:02,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms