./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product31.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/product-lines/email_spec0_product31.cil.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 c46ce92d5d51a05028bbc31057066da504d1448a24c04513108ae9144a2ce103 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:40:06,498 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:40:06,562 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:40:06,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:40:06,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:40:06,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:40:06,591 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:40:06,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:40:06,592 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:40:06,592 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:40:06,592 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:40:06,592 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:40:06,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:40:06,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:40:06,592 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:40:06,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:40:06,596 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:40:06,597 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:40:06,597 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:40:06,597 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:40:06,597 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:40:06,597 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:40:06,597 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:40:06,597 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:40:06,597 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:40:06,597 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:40:06,597 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:40:06,597 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:40:06,597 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:40:06,597 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:40:06,597 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:40:06,597 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:40:06,597 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:40:06,597 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:40:06,597 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:40:06,597 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:40:06,597 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:40:06,597 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:40:06,598 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:40:06,598 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:40:06,598 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:40:06,598 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:40:06,598 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:40:06,598 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 -> c46ce92d5d51a05028bbc31057066da504d1448a24c04513108ae9144a2ce103 [2025-02-05 15:40:06,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:40:06,853 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:40:06,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:40:06,856 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:40:06,856 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:40:06,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product31.cil.c [2025-02-05 15:40:08,029 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56f401b8a/eafe695a02fb4a48a826f8a910f88f61/FLAG9c668489c [2025-02-05 15:40:08,417 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:40:08,419 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product31.cil.c [2025-02-05 15:40:08,437 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56f401b8a/eafe695a02fb4a48a826f8a910f88f61/FLAG9c668489c [2025-02-05 15:40:08,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56f401b8a/eafe695a02fb4a48a826f8a910f88f61 [2025-02-05 15:40:08,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:40:08,606 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:40:08,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:40:08,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:40:08,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:40:08,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:40:08" (1/1) ... [2025-02-05 15:40:08,613 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ad15316 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:08, skipping insertion in model container [2025-02-05 15:40:08,613 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:40:08" (1/1) ... [2025-02-05 15:40:08,661 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:40:08,988 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/product-lines/email_spec0_product31.cil.c[35932,35945] [2025-02-05 15:40:09,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:40:09,058 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:40:09,064 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-02-05 15:40:09,065 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [460] [2025-02-05 15:40:09,065 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [826] [2025-02-05 15:40:09,066 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1051] [2025-02-05 15:40:09,066 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1356] [2025-02-05 15:40:09,066 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [1716] [2025-02-05 15:40:09,066 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1736] [2025-02-05 15:40:09,067 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1771] [2025-02-05 15:40:09,067 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1780] [2025-02-05 15:40:09,067 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2847] [2025-02-05 15:40:09,067 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2982] [2025-02-05 15:40:09,116 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/product-lines/email_spec0_product31.cil.c[35932,35945] [2025-02-05 15:40:09,142 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:40:09,164 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:40:09,164 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:09 WrapperNode [2025-02-05 15:40:09,164 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:40:09,165 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:40:09,165 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:40:09,165 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:40:09,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:09" (1/1) ... [2025-02-05 15:40:09,187 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:09" (1/1) ... [2025-02-05 15:40:09,219 INFO L138 Inliner]: procedures = 131, calls = 203, calls flagged for inlining = 61, calls inlined = 56, statements flattened = 1017 [2025-02-05 15:40:09,220 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:40:09,220 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:40:09,220 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:40:09,220 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:40:09,229 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:09" (1/1) ... [2025-02-05 15:40:09,229 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:09" (1/1) ... [2025-02-05 15:40:09,237 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:09" (1/1) ... [2025-02-05 15:40:09,266 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-02-05 15:40:09,266 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:09" (1/1) ... [2025-02-05 15:40:09,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:09" (1/1) ... [2025-02-05 15:40:09,279 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:09" (1/1) ... [2025-02-05 15:40:09,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:09" (1/1) ... [2025-02-05 15:40:09,282 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:09" (1/1) ... [2025-02-05 15:40:09,284 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:09" (1/1) ... [2025-02-05 15:40:09,287 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:40:09,288 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:40:09,288 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:40:09,288 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:40:09,289 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:09" (1/1) ... [2025-02-05 15:40:09,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:40:09,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:09,318 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-02-05 15:40:09,322 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-02-05 15:40:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-02-05 15:40:09,337 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-02-05 15:40:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-02-05 15:40:09,337 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-02-05 15:40:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-02-05 15:40:09,337 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-02-05 15:40:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:40:09,337 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:40:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:40:09,337 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:40:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:40:09,337 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:40:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:40:09,337 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:40:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-02-05 15:40:09,337 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-02-05 15:40:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:40:09,337 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:40:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:40:09,337 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:40:09,338 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:40:09,338 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:40:09,338 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:40:09,338 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:40:09,338 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:40:09,338 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:40:09,338 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:40:09,338 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-02-05 15:40:09,338 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-02-05 15:40:09,338 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:40:09,338 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:40:09,338 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:40:09,338 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:40:09,338 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:40:09,338 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:40:09,338 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-02-05 15:40:09,338 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-02-05 15:40:09,338 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:40:09,338 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:40:09,338 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-02-05 15:40:09,338 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-02-05 15:40:09,338 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:40:09,338 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:40:09,338 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:40:09,339 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:40:09,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:40:09,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:40:09,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:40:09,339 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:40:09,339 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:40:09,339 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:40:09,339 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:40:09,339 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:40:09,505 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:40:09,507 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:40:09,721 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2777-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~37#1; [2025-02-05 15:40:09,722 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L441-1: isVerified_#res#1 := isVerified_~retValue_acc~10#1; [2025-02-05 15:40:09,722 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L104-1: getEmailId_#res#1 := getEmailId_~retValue_acc~1#1; [2025-02-05 15:40:09,722 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2824-1: getClientId_#res#1 := getClientId_~retValue_acc~38#1; [2025-02-05 15:40:09,728 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L367: #res := ~retValue_acc~8; [2025-02-05 15:40:09,736 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1619: #res := ~retValue_acc~19; [2025-02-05 15:40:09,755 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2481: #res#1 := ~retValue_acc~33#1; [2025-02-05 15:40:09,755 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2436-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~32#1; [2025-02-05 15:40:09,770 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2705: #res := ~retValue_acc~36; [2025-02-05 15:40:09,776 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2389: #res := ~retValue_acc~31; [2025-02-05 15:40:09,783 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2979-1: createEmail_#res#1 := createEmail_~retValue_acc~42#1; [2025-02-05 15:40:09,792 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L293: #res := ~retValue_acc~6; [2025-02-05 15:40:09,800 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L330: #res := ~retValue_acc~7; [2025-02-05 15:40:09,806 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L404: #res := ~retValue_acc~9; [2025-02-05 15:40:09,821 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: #res := ~retValue_acc~3; [2025-02-05 15:40:10,045 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1576-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~16#1; [2025-02-05 15:40:10,045 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1585-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~17#1; [2025-02-05 15:40:10,045 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2651-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~35#1; [2025-02-05 15:40:10,045 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1594-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~18#1; [2025-02-05 15:40:10,045 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2544-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~34#1; [2025-02-05 15:40:10,045 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1768-1: valid_product_#res#1 := valid_product_~retValue_acc~21#1; [2025-02-05 15:40:10,050 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: #res := ~retValue_acc~2; [2025-02-05 15:40:10,057 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2955: #res#1 := ~retValue_acc~40#1; [2025-02-05 15:40:10,057 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2935-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~39#1; [2025-02-05 15:40:10,163 INFO L? ?]: Removed 473 outVars from TransFormulas that were not future-live. [2025-02-05 15:40:10,163 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:40:10,185 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:40:10,185 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:40:10,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:40:10 BoogieIcfgContainer [2025-02-05 15:40:10,188 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:40:10,189 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:40:10,190 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:40:10,193 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:40:10,193 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:40:08" (1/3) ... [2025-02-05 15:40:10,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21efef7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:40:10, skipping insertion in model container [2025-02-05 15:40:10,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:09" (2/3) ... [2025-02-05 15:40:10,194 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21efef7a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:40:10, skipping insertion in model container [2025-02-05 15:40:10,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:40:10" (3/3) ... [2025-02-05 15:40:10,195 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_product31.cil.c [2025-02-05 15:40:10,206 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:40:10,210 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_product31.cil.c that has 24 procedures, 365 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:40:10,268 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:40:10,280 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;@391257ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:40:10,280 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:40:10,288 INFO L276 IsEmpty]: Start isEmpty. Operand has 365 states, 282 states have (on average 1.5) internal successors, (423), 286 states have internal predecessors, (423), 58 states have call successors, (58), 23 states have call predecessors, (58), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-02-05 15:40:10,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-02-05 15:40:10,308 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:10,309 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:10,310 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:10,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:10,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2134064565, now seen corresponding path program 1 times [2025-02-05 15:40:10,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:10,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871816174] [2025-02-05 15:40:10,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:10,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:10,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 15:40:10,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 15:40:10,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:10,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:10,863 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-05 15:40:10,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:10,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871816174] [2025-02-05 15:40:10,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871816174] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:10,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [13415946] [2025-02-05 15:40:10,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:10,867 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:10,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:10,870 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-02-05 15:40:10,873 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-02-05 15:40:11,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-02-05 15:40:11,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-02-05 15:40:11,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:11,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:11,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 1195 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:40:11,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:11,225 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 15:40:11,225 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:11,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [13415946] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:11,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:11,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:40:11,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176125521] [2025-02-05 15:40:11,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:11,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:40:11,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:11,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:40:11,249 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:11,251 INFO L87 Difference]: Start difference. First operand has 365 states, 282 states have (on average 1.5) internal successors, (423), 286 states have internal predecessors, (423), 58 states have call successors, (58), 23 states have call predecessors, (58), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:11,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:11,290 INFO L93 Difference]: Finished difference Result 577 states and 834 transitions. [2025-02-05 15:40:11,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:40:11,292 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 145 [2025-02-05 15:40:11,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:11,300 INFO L225 Difference]: With dead ends: 577 [2025-02-05 15:40:11,300 INFO L226 Difference]: Without dead ends: 358 [2025-02-05 15:40:11,303 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:11,305 INFO L435 NwaCegarLoop]: 536 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, 536 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-02-05 15:40:11,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:11,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2025-02-05 15:40:11,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 358. [2025-02-05 15:40:11,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 276 states have (on average 1.4963768115942029) internal successors, (413), 279 states have internal predecessors, (413), 58 states have call successors, (58), 23 states have call predecessors, (58), 23 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-05 15:40:11,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 528 transitions. [2025-02-05 15:40:11,360 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 528 transitions. Word has length 145 [2025-02-05 15:40:11,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:11,361 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 528 transitions. [2025-02-05 15:40:11,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:11,362 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 528 transitions. [2025-02-05 15:40:11,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-02-05 15:40:11,368 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:11,368 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:11,378 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 15:40:11,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 15:40:11,572 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:11,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:11,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1466421645, now seen corresponding path program 1 times [2025-02-05 15:40:11,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:11,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490637574] [2025-02-05 15:40:11,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:11,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:11,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 15:40:11,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 15:40:11,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:11,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:11,882 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-02-05 15:40:11,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:11,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490637574] [2025-02-05 15:40:11,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490637574] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:11,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1698155357] [2025-02-05 15:40:11,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:11,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:11,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:11,889 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-02-05 15:40:11,893 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-02-05 15:40:12,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-02-05 15:40:12,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-02-05 15:40:12,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:12,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:12,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 1196 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:40:12,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:12,251 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 15:40:12,251 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:12,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1698155357] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:12,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:12,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:40:12,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126131904] [2025-02-05 15:40:12,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:12,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:12,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:12,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:12,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:40:12,253 INFO L87 Difference]: Start difference. First operand 358 states and 528 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:12,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:12,303 INFO L93 Difference]: Finished difference Result 566 states and 815 transitions. [2025-02-05 15:40:12,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:12,303 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2025-02-05 15:40:12,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:12,306 INFO L225 Difference]: With dead ends: 566 [2025-02-05 15:40:12,309 INFO L226 Difference]: Without dead ends: 360 [2025-02-05 15:40:12,311 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:40:12,313 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 0 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1052 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:12,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1052 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:12,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-02-05 15:40:12,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2025-02-05 15:40:12,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 360 states, 278 states have (on average 1.4928057553956835) internal successors, (415), 281 states have internal predecessors, (415), 58 states have call successors, (58), 23 states have call predecessors, (58), 23 states have return successors, (57), 57 states have call predecessors, (57), 57 states have call successors, (57) [2025-02-05 15:40:12,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 530 transitions. [2025-02-05 15:40:12,337 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 530 transitions. Word has length 146 [2025-02-05 15:40:12,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:12,337 INFO L471 AbstractCegarLoop]: Abstraction has 360 states and 530 transitions. [2025-02-05 15:40:12,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 530 transitions. [2025-02-05 15:40:12,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-02-05 15:40:12,340 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:12,340 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:12,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:40:12,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:12,541 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:12,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:12,542 INFO L85 PathProgramCache]: Analyzing trace with hash 154578262, now seen corresponding path program 1 times [2025-02-05 15:40:12,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:12,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297524363] [2025-02-05 15:40:12,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:12,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:12,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 15:40:12,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 15:40:12,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:12,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:12,839 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:40:12,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:12,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297524363] [2025-02-05 15:40:12,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297524363] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:12,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1336251572] [2025-02-05 15:40:12,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:12,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:12,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:12,842 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-02-05 15:40:12,847 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-02-05 15:40:13,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-02-05 15:40:13,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-02-05 15:40:13,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:13,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:13,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:40:13,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:13,201 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-02-05 15:40:13,201 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:13,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1336251572] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:13,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:13,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:40:13,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542590369] [2025-02-05 15:40:13,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:13,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:13,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:13,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:13,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:40:13,203 INFO L87 Difference]: Start difference. First operand 360 states and 530 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:13,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:13,234 INFO L93 Difference]: Finished difference Result 749 states and 1118 transitions. [2025-02-05 15:40:13,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:13,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 151 [2025-02-05 15:40:13,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:13,239 INFO L225 Difference]: With dead ends: 749 [2025-02-05 15:40:13,239 INFO L226 Difference]: Without dead ends: 416 [2025-02-05 15:40:13,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:40:13,242 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 107 mSDsluCounter, 480 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:13,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1019 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:13,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2025-02-05 15:40:13,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 408. [2025-02-05 15:40:13,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 315 states have (on average 1.511111111111111) internal successors, (476), 318 states have internal predecessors, (476), 69 states have call successors, (69), 23 states have call predecessors, (69), 23 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-02-05 15:40:13,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 613 transitions. [2025-02-05 15:40:13,265 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 613 transitions. Word has length 151 [2025-02-05 15:40:13,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:13,265 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 613 transitions. [2025-02-05 15:40:13,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:13,265 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 613 transitions. [2025-02-05 15:40:13,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-02-05 15:40:13,268 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:13,268 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:13,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:40:13,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:13,469 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:13,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:13,469 INFO L85 PathProgramCache]: Analyzing trace with hash 793923128, now seen corresponding path program 1 times [2025-02-05 15:40:13,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:13,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295365091] [2025-02-05 15:40:13,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:13,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:13,493 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 15:40:13,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 15:40:13,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:13,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:13,650 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:40:13,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:13,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295365091] [2025-02-05 15:40:13,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295365091] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:13,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157994915] [2025-02-05 15:40:13,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:13,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:13,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:13,653 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-02-05 15:40:13,657 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-02-05 15:40:13,803 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-02-05 15:40:13,914 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-02-05 15:40:13,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:13,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:13,918 INFO L256 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:40:13,921 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:13,957 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-05 15:40:13,958 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:13,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157994915] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:13,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:13,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:40:13,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417027022] [2025-02-05 15:40:13,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:13,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:13,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:13,959 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:13,959 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:13,959 INFO L87 Difference]: Start difference. First operand 408 states and 613 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:40:14,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:14,002 INFO L93 Difference]: Finished difference Result 807 states and 1216 transitions. [2025-02-05 15:40:14,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:14,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 152 [2025-02-05 15:40:14,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:14,004 INFO L225 Difference]: With dead ends: 807 [2025-02-05 15:40:14,004 INFO L226 Difference]: Without dead ends: 410 [2025-02-05 15:40:14,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 150 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:14,006 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 2 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2069 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:14,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2069 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:14,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-02-05 15:40:14,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2025-02-05 15:40:14,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 316 states have (on average 1.509493670886076) internal successors, (477), 320 states have internal predecessors, (477), 69 states have call successors, (69), 23 states have call predecessors, (69), 24 states have return successors, (70), 68 states have call predecessors, (70), 68 states have call successors, (70) [2025-02-05 15:40:14,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 616 transitions. [2025-02-05 15:40:14,019 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 616 transitions. Word has length 152 [2025-02-05 15:40:14,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:14,019 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 616 transitions. [2025-02-05 15:40:14,019 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:40:14,019 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 616 transitions. [2025-02-05 15:40:14,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-02-05 15:40:14,021 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:14,021 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:14,028 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:40:14,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:14,222 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:14,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:14,223 INFO L85 PathProgramCache]: Analyzing trace with hash 95853036, now seen corresponding path program 1 times [2025-02-05 15:40:14,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:14,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458200262] [2025-02-05 15:40:14,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:14,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:14,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 15:40:14,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 15:40:14,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:14,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:14,381 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 15:40:14,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:14,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458200262] [2025-02-05 15:40:14,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458200262] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:14,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [805465705] [2025-02-05 15:40:14,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:14,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:14,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:14,383 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-02-05 15:40:14,385 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-02-05 15:40:14,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-02-05 15:40:14,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-02-05 15:40:14,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:14,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:14,635 INFO L256 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:40:14,638 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:14,676 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-05 15:40:14,676 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:14,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [805465705] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:14,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:14,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:40:14,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509286100] [2025-02-05 15:40:14,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:14,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:14,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:14,677 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:14,677 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:40:14,678 INFO L87 Difference]: Start difference. First operand 410 states and 616 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:40:14,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:14,727 INFO L93 Difference]: Finished difference Result 809 states and 1221 transitions. [2025-02-05 15:40:14,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:14,728 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 153 [2025-02-05 15:40:14,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:14,730 INFO L225 Difference]: With dead ends: 809 [2025-02-05 15:40:14,730 INFO L226 Difference]: Without dead ends: 412 [2025-02-05 15:40:14,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:40:14,731 INFO L435 NwaCegarLoop]: 518 mSDtfsCounter, 2 mSDsluCounter, 1537 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2055 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:14,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2055 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:14,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-02-05 15:40:14,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2025-02-05 15:40:14,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 317 states have (on average 1.5078864353312302) internal successors, (478), 322 states have internal predecessors, (478), 69 states have call successors, (69), 23 states have call predecessors, (69), 25 states have return successors, (75), 68 states have call predecessors, (75), 68 states have call successors, (75) [2025-02-05 15:40:14,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 622 transitions. [2025-02-05 15:40:14,745 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 622 transitions. Word has length 153 [2025-02-05 15:40:14,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:14,745 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 622 transitions. [2025-02-05 15:40:14,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:40:14,745 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 622 transitions. [2025-02-05 15:40:14,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-02-05 15:40:14,747 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:14,747 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:14,758 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-02-05 15:40:14,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:14,947 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:14,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:14,948 INFO L85 PathProgramCache]: Analyzing trace with hash -508449822, now seen corresponding path program 1 times [2025-02-05 15:40:14,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:14,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975386067] [2025-02-05 15:40:14,948 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:14,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:14,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-02-05 15:40:14,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-02-05 15:40:14,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:14,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:15,160 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-02-05 15:40:15,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:15,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975386067] [2025-02-05 15:40:15,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975386067] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:15,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:15,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:40:15,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593501234] [2025-02-05 15:40:15,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:15,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:15,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:15,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:15,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:15,166 INFO L87 Difference]: Start difference. First operand 412 states and 622 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:40:15,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:15,239 INFO L93 Difference]: Finished difference Result 801 states and 1212 transitions. [2025-02-05 15:40:15,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:15,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 154 [2025-02-05 15:40:15,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:15,243 INFO L225 Difference]: With dead ends: 801 [2025-02-05 15:40:15,248 INFO L226 Difference]: Without dead ends: 412 [2025-02-05 15:40:15,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:15,254 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 2 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2073 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:15,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2073 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:15,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2025-02-05 15:40:15,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2025-02-05 15:40:15,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 317 states have (on average 1.5078864353312302) internal successors, (478), 322 states have internal predecessors, (478), 69 states have call successors, (69), 23 states have call predecessors, (69), 25 states have return successors, (74), 68 states have call predecessors, (74), 68 states have call successors, (74) [2025-02-05 15:40:15,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 621 transitions. [2025-02-05 15:40:15,291 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 621 transitions. Word has length 154 [2025-02-05 15:40:15,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:15,291 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 621 transitions. [2025-02-05 15:40:15,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:40:15,291 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 621 transitions. [2025-02-05 15:40:15,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-02-05 15:40:15,293 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:15,293 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:15,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:40:15,293 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:15,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:15,294 INFO L85 PathProgramCache]: Analyzing trace with hash -77267276, now seen corresponding path program 2 times [2025-02-05 15:40:15,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:15,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1885631087] [2025-02-05 15:40:15,294 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:40:15,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:15,313 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 155 statements into 2 equivalence classes. [2025-02-05 15:40:15,318 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 59 of 155 statements. [2025-02-05 15:40:15,318 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:40:15,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:15,404 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2025-02-05 15:40:15,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:15,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1885631087] [2025-02-05 15:40:15,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1885631087] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:15,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:15,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:40:15,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746320504] [2025-02-05 15:40:15,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:15,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:40:15,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:15,405 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:40:15,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:15,405 INFO L87 Difference]: Start difference. First operand 412 states and 621 transitions. Second operand has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:40:15,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:15,786 INFO L93 Difference]: Finished difference Result 1088 states and 1624 transitions. [2025-02-05 15:40:15,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-05 15:40:15,787 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) Word has length 155 [2025-02-05 15:40:15,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:15,791 INFO L225 Difference]: With dead ends: 1088 [2025-02-05 15:40:15,791 INFO L226 Difference]: Without dead ends: 890 [2025-02-05 15:40:15,792 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-02-05 15:40:15,793 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 571 mSDsluCounter, 3195 mSDsCounter, 0 mSdLazyCounter, 461 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 3786 SdHoareTripleChecker+Invalid, 492 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 461 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:15,793 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 3786 Invalid, 492 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 461 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 15:40:15,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2025-02-05 15:40:15,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 805. [2025-02-05 15:40:15,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 805 states, 623 states have (on average 1.5168539325842696) internal successors, (945), 630 states have internal predecessors, (945), 132 states have call successors, (132), 46 states have call predecessors, (132), 49 states have return successors, (145), 132 states have call predecessors, (145), 130 states have call successors, (145) [2025-02-05 15:40:15,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1222 transitions. [2025-02-05 15:40:15,826 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1222 transitions. Word has length 155 [2025-02-05 15:40:15,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:15,826 INFO L471 AbstractCegarLoop]: Abstraction has 805 states and 1222 transitions. [2025-02-05 15:40:15,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 7 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:40:15,826 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1222 transitions. [2025-02-05 15:40:15,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-02-05 15:40:15,829 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:15,829 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:15,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:40:15,829 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:15,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:15,829 INFO L85 PathProgramCache]: Analyzing trace with hash -1344047480, now seen corresponding path program 3 times [2025-02-05 15:40:15,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:15,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616668967] [2025-02-05 15:40:15,830 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-05 15:40:15,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:15,849 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 156 statements into 3 equivalence classes. [2025-02-05 15:40:15,858 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 144 of 156 statements. [2025-02-05 15:40:15,858 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-05 15:40:15,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:15,951 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-02-05 15:40:15,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:15,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616668967] [2025-02-05 15:40:15,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616668967] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:15,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:15,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:40:15,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239654211] [2025-02-05 15:40:15,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:15,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:15,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:15,952 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:15,952 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:15,952 INFO L87 Difference]: Start difference. First operand 805 states and 1222 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:40:16,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:16,020 INFO L93 Difference]: Finished difference Result 1983 states and 2969 transitions. [2025-02-05 15:40:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 15:40:16,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 156 [2025-02-05 15:40:16,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:16,029 INFO L225 Difference]: With dead ends: 1983 [2025-02-05 15:40:16,029 INFO L226 Difference]: Without dead ends: 1585 [2025-02-05 15:40:16,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:40:16,031 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 468 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 2070 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:16,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 2070 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2025-02-05 15:40:16,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1583. [2025-02-05 15:40:16,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1583 states, 1228 states have (on average 1.521986970684039) internal successors, (1869), 1242 states have internal predecessors, (1869), 258 states have call successors, (258), 91 states have call predecessors, (258), 96 states have return successors, (281), 257 states have call predecessors, (281), 254 states have call successors, (281) [2025-02-05 15:40:16,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1583 states to 1583 states and 2408 transitions. [2025-02-05 15:40:16,114 INFO L78 Accepts]: Start accepts. Automaton has 1583 states and 2408 transitions. Word has length 156 [2025-02-05 15:40:16,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:16,114 INFO L471 AbstractCegarLoop]: Abstraction has 1583 states and 2408 transitions. [2025-02-05 15:40:16,114 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:40:16,114 INFO L276 IsEmpty]: Start isEmpty. Operand 1583 states and 2408 transitions. [2025-02-05 15:40:16,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-02-05 15:40:16,120 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:16,120 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:16,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:40:16,120 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:16,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:16,120 INFO L85 PathProgramCache]: Analyzing trace with hash 312297278, now seen corresponding path program 1 times [2025-02-05 15:40:16,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:16,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801960999] [2025-02-05 15:40:16,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:16,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:16,140 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-02-05 15:40:16,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-02-05 15:40:16,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:16,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:16,281 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-05 15:40:16,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:16,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801960999] [2025-02-05 15:40:16,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801960999] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:16,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:16,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:40:16,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000874017] [2025-02-05 15:40:16,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:16,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:16,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:16,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:16,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:16,283 INFO L87 Difference]: Start difference. First operand 1583 states and 2408 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:40:16,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:16,380 INFO L93 Difference]: Finished difference Result 3145 states and 4789 transitions. [2025-02-05 15:40:16,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:16,381 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 157 [2025-02-05 15:40:16,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:16,392 INFO L225 Difference]: With dead ends: 3145 [2025-02-05 15:40:16,392 INFO L226 Difference]: Without dead ends: 1585 [2025-02-05 15:40:16,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:16,400 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 1 mSDsluCounter, 1554 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2076 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:16,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2076 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:16,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2025-02-05 15:40:16,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1585. [2025-02-05 15:40:16,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1585 states, 1229 states have (on average 1.5215622457282343) internal successors, (1870), 1244 states have internal predecessors, (1870), 258 states have call successors, (258), 91 states have call predecessors, (258), 97 states have return successors, (283), 257 states have call predecessors, (283), 254 states have call successors, (283) [2025-02-05 15:40:16,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1585 states to 1585 states and 2411 transitions. [2025-02-05 15:40:16,463 INFO L78 Accepts]: Start accepts. Automaton has 1585 states and 2411 transitions. Word has length 157 [2025-02-05 15:40:16,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:16,463 INFO L471 AbstractCegarLoop]: Abstraction has 1585 states and 2411 transitions. [2025-02-05 15:40:16,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-02-05 15:40:16,463 INFO L276 IsEmpty]: Start isEmpty. Operand 1585 states and 2411 transitions. [2025-02-05 15:40:16,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 15:40:16,467 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:16,467 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:16,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:40:16,468 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:16,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:16,468 INFO L85 PathProgramCache]: Analyzing trace with hash -315211575, now seen corresponding path program 1 times [2025-02-05 15:40:16,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:16,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502974737] [2025-02-05 15:40:16,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:16,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:16,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 15:40:16,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 15:40:16,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:16,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:16,615 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 15:40:16,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:16,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502974737] [2025-02-05 15:40:16,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1502974737] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:16,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:16,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:40:16,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426372202] [2025-02-05 15:40:16,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:16,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:40:16,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:16,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:40:16,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:16,617 INFO L87 Difference]: Start difference. First operand 1585 states and 2411 transitions. Second operand has 8 states, 7 states have (on average 13.428571428571429) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-05 15:40:16,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:16,755 INFO L93 Difference]: Finished difference Result 2374 states and 3609 transitions. [2025-02-05 15:40:16,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:40:16,756 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.428571428571429) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 158 [2025-02-05 15:40:16,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:16,764 INFO L225 Difference]: With dead ends: 2374 [2025-02-05 15:40:16,764 INFO L226 Difference]: Without dead ends: 1600 [2025-02-05 15:40:16,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:40:16,767 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 5 mSDsluCounter, 3043 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3555 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:16,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3555 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:40:16,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1600 states. [2025-02-05 15:40:16,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1600 to 1590. [2025-02-05 15:40:16,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1590 states, 1233 states have (on average 1.5206812652068127) internal successors, (1875), 1248 states have internal predecessors, (1875), 258 states have call successors, (258), 92 states have call predecessors, (258), 98 states have return successors, (288), 257 states have call predecessors, (288), 254 states have call successors, (288) [2025-02-05 15:40:16,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1590 states to 1590 states and 2421 transitions. [2025-02-05 15:40:16,828 INFO L78 Accepts]: Start accepts. Automaton has 1590 states and 2421 transitions. Word has length 158 [2025-02-05 15:40:16,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:16,828 INFO L471 AbstractCegarLoop]: Abstraction has 1590 states and 2421 transitions. [2025-02-05 15:40:16,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.428571428571429) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-05 15:40:16,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1590 states and 2421 transitions. [2025-02-05 15:40:16,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 15:40:16,833 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:16,833 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:16,833 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:40:16,833 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:16,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:16,833 INFO L85 PathProgramCache]: Analyzing trace with hash -2048673718, now seen corresponding path program 1 times [2025-02-05 15:40:16,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:16,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266592179] [2025-02-05 15:40:16,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:16,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:16,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 15:40:16,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 15:40:16,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:16,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:16,954 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-02-05 15:40:16,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:16,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266592179] [2025-02-05 15:40:16,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266592179] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:16,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:16,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 15:40:16,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1560887759] [2025-02-05 15:40:16,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:16,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 15:40:16,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:16,955 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 15:40:16,955 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:16,955 INFO L87 Difference]: Start difference. First operand 1590 states and 2421 transitions. Second operand has 8 states, 7 states have (on average 13.571428571428571) internal successors, (95), 8 states have internal predecessors, (95), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-05 15:40:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:17,066 INFO L93 Difference]: Finished difference Result 2362 states and 3593 transitions. [2025-02-05 15:40:17,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 15:40:17,067 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.571428571428571) internal successors, (95), 8 states have internal predecessors, (95), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 158 [2025-02-05 15:40:17,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:17,071 INFO L225 Difference]: With dead ends: 2362 [2025-02-05 15:40:17,071 INFO L226 Difference]: Without dead ends: 804 [2025-02-05 15:40:17,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-05 15:40:17,074 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 7 mSDsluCounter, 3043 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3555 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:17,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3555 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:40:17,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2025-02-05 15:40:17,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 802. [2025-02-05 15:40:17,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 802 states, 620 states have (on average 1.514516129032258) internal successors, (939), 629 states have internal predecessors, (939), 132 states have call successors, (132), 46 states have call predecessors, (132), 49 states have return successors, (142), 130 states have call predecessors, (142), 130 states have call successors, (142) [2025-02-05 15:40:17,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 802 states to 802 states and 1213 transitions. [2025-02-05 15:40:17,097 INFO L78 Accepts]: Start accepts. Automaton has 802 states and 1213 transitions. Word has length 158 [2025-02-05 15:40:17,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:17,097 INFO L471 AbstractCegarLoop]: Abstraction has 802 states and 1213 transitions. [2025-02-05 15:40:17,097 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.571428571428571) internal successors, (95), 8 states have internal predecessors, (95), 4 states have call successors, (20), 2 states have call predecessors, (20), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-02-05 15:40:17,098 INFO L276 IsEmpty]: Start isEmpty. Operand 802 states and 1213 transitions. [2025-02-05 15:40:17,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-02-05 15:40:17,100 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:17,100 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:17,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:40:17,100 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:17,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:17,100 INFO L85 PathProgramCache]: Analyzing trace with hash -416046358, now seen corresponding path program 1 times [2025-02-05 15:40:17,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:17,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436736969] [2025-02-05 15:40:17,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:17,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:17,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 15:40:17,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 15:40:17,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:17,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:17,179 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:40:17,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:17,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436736969] [2025-02-05 15:40:17,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436736969] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:17,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946426336] [2025-02-05 15:40:17,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:17,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:17,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:17,209 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:40:17,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 15:40:17,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-02-05 15:40:17,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-02-05 15:40:17,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:17,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:17,475 INFO L256 TraceCheckSpWp]: Trace formula consists of 1220 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:40:17,478 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:17,498 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:40:17,498 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:40:17,581 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:40:17,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946426336] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:40:17,581 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:40:17,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 15:40:17,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457878922] [2025-02-05 15:40:17,581 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:40:17,582 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:40:17,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:17,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:40:17,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:40:17,582 INFO L87 Difference]: Start difference. First operand 802 states and 1213 transitions. Second operand has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 15:40:17,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:17,718 INFO L93 Difference]: Finished difference Result 1785 states and 2764 transitions. [2025-02-05 15:40:17,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:40:17,718 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 159 [2025-02-05 15:40:17,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:17,725 INFO L225 Difference]: With dead ends: 1785 [2025-02-05 15:40:17,725 INFO L226 Difference]: Without dead ends: 1371 [2025-02-05 15:40:17,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:40:17,728 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 417 mSDsluCounter, 1396 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1980 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:17,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1980 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 15:40:17,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1371 states. [2025-02-05 15:40:17,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1371 to 1331. [2025-02-05 15:40:17,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1331 states, 1046 states have (on average 1.5745697896749522) internal successors, (1647), 1055 states have internal predecessors, (1647), 235 states have call successors, (235), 46 states have call predecessors, (235), 49 states have return successors, (255), 233 states have call predecessors, (255), 233 states have call successors, (255) [2025-02-05 15:40:17,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1331 states to 1331 states and 2137 transitions. [2025-02-05 15:40:17,784 INFO L78 Accepts]: Start accepts. Automaton has 1331 states and 2137 transitions. Word has length 159 [2025-02-05 15:40:17,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:17,784 INFO L471 AbstractCegarLoop]: Abstraction has 1331 states and 2137 transitions. [2025-02-05 15:40:17,784 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 17.857142857142858) internal successors, (125), 7 states have internal predecessors, (125), 2 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2025-02-05 15:40:17,784 INFO L276 IsEmpty]: Start isEmpty. Operand 1331 states and 2137 transitions. [2025-02-05 15:40:17,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-02-05 15:40:17,790 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:17,790 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:17,798 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 15:40:17,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-05 15:40:17,990 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:17,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:17,991 INFO L85 PathProgramCache]: Analyzing trace with hash -400680118, now seen corresponding path program 1 times [2025-02-05 15:40:17,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:17,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894334573] [2025-02-05 15:40:17,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:17,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:18,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-02-05 15:40:18,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-02-05 15:40:18,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:18,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:18,043 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:40:18,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:18,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894334573] [2025-02-05 15:40:18,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894334573] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:18,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:18,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:18,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708937746] [2025-02-05 15:40:18,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:18,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:18,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:18,045 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:18,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:18,045 INFO L87 Difference]: Start difference. First operand 1331 states and 2137 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:18,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:18,086 INFO L93 Difference]: Finished difference Result 3132 states and 5098 transitions. [2025-02-05 15:40:18,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:18,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 165 [2025-02-05 15:40:18,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:18,095 INFO L225 Difference]: With dead ends: 3132 [2025-02-05 15:40:18,095 INFO L226 Difference]: Without dead ends: 1870 [2025-02-05 15:40:18,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:18,099 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 105 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:18,099 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1063 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:18,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2025-02-05 15:40:18,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1854. [2025-02-05 15:40:18,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1466 states have (on average 1.5914051841746248) internal successors, (2333), 1475 states have internal predecessors, (2333), 338 states have call successors, (338), 46 states have call predecessors, (338), 49 states have return successors, (368), 336 states have call predecessors, (368), 336 states have call successors, (368) [2025-02-05 15:40:18,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 3039 transitions. [2025-02-05 15:40:18,158 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 3039 transitions. Word has length 165 [2025-02-05 15:40:18,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:18,158 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 3039 transitions. [2025-02-05 15:40:18,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:18,158 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 3039 transitions. [2025-02-05 15:40:18,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-02-05 15:40:18,165 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:18,165 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:18,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:40:18,165 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:18,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:18,165 INFO L85 PathProgramCache]: Analyzing trace with hash -593778635, now seen corresponding path program 1 times [2025-02-05 15:40:18,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:18,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78831600] [2025-02-05 15:40:18,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:18,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:18,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-02-05 15:40:18,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-02-05 15:40:18,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:18,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:40:18,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:18,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78831600] [2025-02-05 15:40:18,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78831600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:18,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:18,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:18,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025593061] [2025-02-05 15:40:18,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:18,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:18,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:18,217 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:18,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:18,218 INFO L87 Difference]: Start difference. First operand 1854 states and 3039 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:18,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:18,276 INFO L93 Difference]: Finished difference Result 4420 states and 7302 transitions. [2025-02-05 15:40:18,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:18,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 166 [2025-02-05 15:40:18,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:18,290 INFO L225 Difference]: With dead ends: 4420 [2025-02-05 15:40:18,290 INFO L226 Difference]: Without dead ends: 2686 [2025-02-05 15:40:18,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:18,296 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 103 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:18,297 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1058 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:18,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2025-02-05 15:40:18,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2670. [2025-02-05 15:40:18,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2670 states, 2128 states have (on average 1.6038533834586466) internal successors, (3413), 2137 states have internal predecessors, (3413), 492 states have call successors, (492), 46 states have call predecessors, (492), 49 states have return successors, (522), 490 states have call predecessors, (522), 490 states have call successors, (522) [2025-02-05 15:40:18,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2670 states to 2670 states and 4427 transitions. [2025-02-05 15:40:18,422 INFO L78 Accepts]: Start accepts. Automaton has 2670 states and 4427 transitions. Word has length 166 [2025-02-05 15:40:18,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:18,423 INFO L471 AbstractCegarLoop]: Abstraction has 2670 states and 4427 transitions. [2025-02-05 15:40:18,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 2670 states and 4427 transitions. [2025-02-05 15:40:18,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-02-05 15:40:18,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:18,434 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:18,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 15:40:18,435 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:18,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:18,435 INFO L85 PathProgramCache]: Analyzing trace with hash -954372375, now seen corresponding path program 1 times [2025-02-05 15:40:18,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:18,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760017978] [2025-02-05 15:40:18,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:18,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:18,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-02-05 15:40:18,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-02-05 15:40:18,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:18,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:18,485 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:40:18,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:18,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760017978] [2025-02-05 15:40:18,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760017978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:18,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:18,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:18,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74285591] [2025-02-05 15:40:18,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:18,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:18,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:18,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:18,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:18,486 INFO L87 Difference]: Start difference. First operand 2670 states and 4427 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:18,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:18,570 INFO L93 Difference]: Finished difference Result 6383 states and 10669 transitions. [2025-02-05 15:40:18,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:18,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 167 [2025-02-05 15:40:18,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:18,589 INFO L225 Difference]: With dead ends: 6383 [2025-02-05 15:40:18,589 INFO L226 Difference]: Without dead ends: 3955 [2025-02-05 15:40:18,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:18,598 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 101 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:18,598 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1045 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:18,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3955 states. [2025-02-05 15:40:18,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3955 to 3939. [2025-02-05 15:40:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3939 states, 3191 states have (on average 1.6154810404261988) internal successors, (5155), 3200 states have internal predecessors, (5155), 698 states have call successors, (698), 46 states have call predecessors, (698), 49 states have return successors, (744), 696 states have call predecessors, (744), 696 states have call successors, (744) [2025-02-05 15:40:18,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3939 states to 3939 states and 6597 transitions. [2025-02-05 15:40:18,731 INFO L78 Accepts]: Start accepts. Automaton has 3939 states and 6597 transitions. Word has length 167 [2025-02-05 15:40:18,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:18,731 INFO L471 AbstractCegarLoop]: Abstraction has 3939 states and 6597 transitions. [2025-02-05 15:40:18,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:18,732 INFO L276 IsEmpty]: Start isEmpty. Operand 3939 states and 6597 transitions. [2025-02-05 15:40:18,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-02-05 15:40:18,751 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:18,752 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:18,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 15:40:18,752 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:18,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:18,752 INFO L85 PathProgramCache]: Analyzing trace with hash 25624118, now seen corresponding path program 1 times [2025-02-05 15:40:18,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:18,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442415972] [2025-02-05 15:40:18,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:18,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:18,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-02-05 15:40:18,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-02-05 15:40:18,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:18,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:18,807 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:40:18,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:18,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442415972] [2025-02-05 15:40:18,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442415972] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:18,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:18,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:18,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571913180] [2025-02-05 15:40:18,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:18,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:18,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:18,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:18,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:18,809 INFO L87 Difference]: Start difference. First operand 3939 states and 6597 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:18,953 INFO L93 Difference]: Finished difference Result 9556 states and 16118 transitions. [2025-02-05 15:40:18,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:18,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 168 [2025-02-05 15:40:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:18,980 INFO L225 Difference]: With dead ends: 9556 [2025-02-05 15:40:18,981 INFO L226 Difference]: Without dead ends: 6059 [2025-02-05 15:40:18,994 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:18,994 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 99 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1045 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:18,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1045 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:18,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6059 states. [2025-02-05 15:40:19,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6059 to 6043. [2025-02-05 15:40:19,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6043 states, 4985 states have (on average 1.6252758274824473) internal successors, (8102), 4994 states have internal predecessors, (8102), 1008 states have call successors, (1008), 46 states have call predecessors, (1008), 49 states have return successors, (1080), 1006 states have call predecessors, (1080), 1006 states have call successors, (1080) [2025-02-05 15:40:19,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6043 states to 6043 states and 10190 transitions. [2025-02-05 15:40:19,204 INFO L78 Accepts]: Start accepts. Automaton has 6043 states and 10190 transitions. Word has length 168 [2025-02-05 15:40:19,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:19,204 INFO L471 AbstractCegarLoop]: Abstraction has 6043 states and 10190 transitions. [2025-02-05 15:40:19,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:19,204 INFO L276 IsEmpty]: Start isEmpty. Operand 6043 states and 10190 transitions. [2025-02-05 15:40:19,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-02-05 15:40:19,230 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:19,230 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:19,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 15:40:19,230 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:19,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:19,231 INFO L85 PathProgramCache]: Analyzing trace with hash 756095912, now seen corresponding path program 1 times [2025-02-05 15:40:19,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:19,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300830795] [2025-02-05 15:40:19,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:19,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:19,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-02-05 15:40:19,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-02-05 15:40:19,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:19,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:19,313 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:40:19,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:19,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300830795] [2025-02-05 15:40:19,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300830795] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:19,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:19,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:19,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297681073] [2025-02-05 15:40:19,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:19,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:19,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:19,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:19,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:19,314 INFO L87 Difference]: Start difference. First operand 6043 states and 10190 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:19,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:19,497 INFO L93 Difference]: Finished difference Result 14607 states and 24841 transitions. [2025-02-05 15:40:19,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:19,497 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 169 [2025-02-05 15:40:19,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:19,533 INFO L225 Difference]: With dead ends: 14607 [2025-02-05 15:40:19,533 INFO L226 Difference]: Without dead ends: 9760 [2025-02-05 15:40:19,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:19,550 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 97 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:19,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1055 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:19,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9760 states. [2025-02-05 15:40:19,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9760 to 9744. [2025-02-05 15:40:19,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9744 states, 7984 states have (on average 1.627129258517034) internal successors, (12991), 7993 states have internal predecessors, (12991), 1710 states have call successors, (1710), 46 states have call predecessors, (1710), 49 states have return successors, (1826), 1708 states have call predecessors, (1826), 1708 states have call successors, (1826) [2025-02-05 15:40:19,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9744 states to 9744 states and 16527 transitions. [2025-02-05 15:40:19,968 INFO L78 Accepts]: Start accepts. Automaton has 9744 states and 16527 transitions. Word has length 169 [2025-02-05 15:40:19,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:19,968 INFO L471 AbstractCegarLoop]: Abstraction has 9744 states and 16527 transitions. [2025-02-05 15:40:19,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand 9744 states and 16527 transitions. [2025-02-05 15:40:20,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-02-05 15:40:20,008 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:20,009 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:20,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 15:40:20,009 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:20,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:20,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1981327927, now seen corresponding path program 1 times [2025-02-05 15:40:20,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:20,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908304337] [2025-02-05 15:40:20,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:20,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:20,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-02-05 15:40:20,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-02-05 15:40:20,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:20,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:20,076 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:40:20,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:20,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908304337] [2025-02-05 15:40:20,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908304337] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:20,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:20,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:20,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [399440739] [2025-02-05 15:40:20,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:20,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:20,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:20,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:20,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:20,078 INFO L87 Difference]: Start difference. First operand 9744 states and 16527 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:20,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:20,395 INFO L93 Difference]: Finished difference Result 24822 states and 42366 transitions. [2025-02-05 15:40:20,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:20,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 170 [2025-02-05 15:40:20,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:20,459 INFO L225 Difference]: With dead ends: 24822 [2025-02-05 15:40:20,459 INFO L226 Difference]: Without dead ends: 16585 [2025-02-05 15:40:20,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:20,488 INFO L435 NwaCegarLoop]: 536 mSDtfsCounter, 95 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:20,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1058 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:20,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16585 states. [2025-02-05 15:40:21,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16585 to 16569. [2025-02-05 15:40:21,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16569 states, 13665 states have (on average 1.6266373948042445) internal successors, (22228), 13674 states have internal predecessors, (22228), 2854 states have call successors, (2854), 46 states have call predecessors, (2854), 49 states have return successors, (3048), 2852 states have call predecessors, (3048), 2852 states have call successors, (3048) [2025-02-05 15:40:21,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16569 states to 16569 states and 28130 transitions. [2025-02-05 15:40:21,109 INFO L78 Accepts]: Start accepts. Automaton has 16569 states and 28130 transitions. Word has length 170 [2025-02-05 15:40:21,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:21,110 INFO L471 AbstractCegarLoop]: Abstraction has 16569 states and 28130 transitions. [2025-02-05 15:40:21,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:21,110 INFO L276 IsEmpty]: Start isEmpty. Operand 16569 states and 28130 transitions. [2025-02-05 15:40:21,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-02-05 15:40:21,165 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:21,165 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:21,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 15:40:21,165 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:21,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:21,166 INFO L85 PathProgramCache]: Analyzing trace with hash 2035278471, now seen corresponding path program 1 times [2025-02-05 15:40:21,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:21,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969846225] [2025-02-05 15:40:21,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:21,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:21,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-02-05 15:40:21,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-02-05 15:40:21,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:21,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:21,216 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:40:21,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:21,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969846225] [2025-02-05 15:40:21,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969846225] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:21,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:21,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:21,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578371811] [2025-02-05 15:40:21,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:21,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:21,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:21,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:21,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:21,218 INFO L87 Difference]: Start difference. First operand 16569 states and 28130 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:21,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:21,898 INFO L93 Difference]: Finished difference Result 44178 states and 75308 transitions. [2025-02-05 15:40:21,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:21,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 171 [2025-02-05 15:40:21,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:22,010 INFO L225 Difference]: With dead ends: 44178 [2025-02-05 15:40:22,010 INFO L226 Difference]: Without dead ends: 29729 [2025-02-05 15:40:22,055 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:22,056 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 93 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:22,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1067 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:22,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29729 states. [2025-02-05 15:40:23,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29729 to 29713. [2025-02-05 15:40:23,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29713 states, 24490 states have (on average 1.6182931808901593) internal successors, (39632), 24499 states have internal predecessors, (39632), 5173 states have call successors, (5173), 46 states have call predecessors, (5173), 49 states have return successors, (5511), 5171 states have call predecessors, (5511), 5171 states have call successors, (5511) [2025-02-05 15:40:23,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29713 states to 29713 states and 50316 transitions. [2025-02-05 15:40:23,450 INFO L78 Accepts]: Start accepts. Automaton has 29713 states and 50316 transitions. Word has length 171 [2025-02-05 15:40:23,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:23,451 INFO L471 AbstractCegarLoop]: Abstraction has 29713 states and 50316 transitions. [2025-02-05 15:40:23,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:23,451 INFO L276 IsEmpty]: Start isEmpty. Operand 29713 states and 50316 transitions. [2025-02-05 15:40:23,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-02-05 15:40:23,535 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:23,535 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:23,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 15:40:23,535 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:23,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:23,537 INFO L85 PathProgramCache]: Analyzing trace with hash -991947336, now seen corresponding path program 1 times [2025-02-05 15:40:23,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:23,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246749970] [2025-02-05 15:40:23,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:23,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:23,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-02-05 15:40:23,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-02-05 15:40:23,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:23,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:23,589 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:40:23,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:23,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246749970] [2025-02-05 15:40:23,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246749970] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:23,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:23,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:23,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069824028] [2025-02-05 15:40:23,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:23,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:23,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:23,591 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:23,591 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:23,591 INFO L87 Difference]: Start difference. First operand 29713 states and 50316 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:24,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:24,472 INFO L93 Difference]: Finished difference Result 80693 states and 137247 transitions. [2025-02-05 15:40:24,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:24,472 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 172 [2025-02-05 15:40:24,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:24,671 INFO L225 Difference]: With dead ends: 80693 [2025-02-05 15:40:24,671 INFO L226 Difference]: Without dead ends: 53952 [2025-02-05 15:40:24,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:24,732 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 91 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:24,732 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1048 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:24,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53952 states. [2025-02-05 15:40:26,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53952 to 53936. [2025-02-05 15:40:26,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53936 states, 44728 states have (on average 1.6146708996601682) internal successors, (72221), 44737 states have internal predecessors, (72221), 9158 states have call successors, (9158), 46 states have call predecessors, (9158), 49 states have return successors, (9770), 9156 states have call predecessors, (9770), 9156 states have call successors, (9770) [2025-02-05 15:40:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53936 states to 53936 states and 91149 transitions. [2025-02-05 15:40:26,819 INFO L78 Accepts]: Start accepts. Automaton has 53936 states and 91149 transitions. Word has length 172 [2025-02-05 15:40:26,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:26,819 INFO L471 AbstractCegarLoop]: Abstraction has 53936 states and 91149 transitions. [2025-02-05 15:40:26,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:26,820 INFO L276 IsEmpty]: Start isEmpty. Operand 53936 states and 91149 transitions. [2025-02-05 15:40:26,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2025-02-05 15:40:26,938 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:26,938 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:26,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 15:40:26,939 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:26,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:26,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1379164026, now seen corresponding path program 1 times [2025-02-05 15:40:26,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:26,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129684944] [2025-02-05 15:40:26,939 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:26,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:26,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 173 statements into 1 equivalence classes. [2025-02-05 15:40:26,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 173 of 173 statements. [2025-02-05 15:40:26,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:26,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:27,004 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:40:27,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:27,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129684944] [2025-02-05 15:40:27,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129684944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:27,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:27,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:27,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255061027] [2025-02-05 15:40:27,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:27,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:27,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:27,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:27,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:27,007 INFO L87 Difference]: Start difference. First operand 53936 states and 91149 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:28,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:28,951 INFO L93 Difference]: Finished difference Result 149993 states and 254335 transitions. [2025-02-05 15:40:28,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:28,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 173 [2025-02-05 15:40:28,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:29,389 INFO L225 Difference]: With dead ends: 149993 [2025-02-05 15:40:29,390 INFO L226 Difference]: Without dead ends: 100028 [2025-02-05 15:40:29,558 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:29,559 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 89 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:29,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1048 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:29,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100028 states. [2025-02-05 15:40:33,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100028 to 100012. [2025-02-05 15:40:33,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100012 states, 83479 states have (on average 1.6092670012817596) internal successors, (134340), 83488 states have internal predecessors, (134340), 16483 states have call successors, (16483), 46 states have call predecessors, (16483), 49 states have return successors, (17627), 16481 states have call predecessors, (17627), 16481 states have call successors, (17627) [2025-02-05 15:40:33,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100012 states to 100012 states and 168450 transitions. [2025-02-05 15:40:33,916 INFO L78 Accepts]: Start accepts. Automaton has 100012 states and 168450 transitions. Word has length 173 [2025-02-05 15:40:33,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:33,916 INFO L471 AbstractCegarLoop]: Abstraction has 100012 states and 168450 transitions. [2025-02-05 15:40:33,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:33,917 INFO L276 IsEmpty]: Start isEmpty. Operand 100012 states and 168450 transitions. [2025-02-05 15:40:34,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-02-05 15:40:34,111 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:34,111 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:34,111 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 15:40:34,112 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:34,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:34,112 INFO L85 PathProgramCache]: Analyzing trace with hash -1531159079, now seen corresponding path program 1 times [2025-02-05 15:40:34,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:34,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218165449] [2025-02-05 15:40:34,112 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:34,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:34,134 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-02-05 15:40:34,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-02-05 15:40:34,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:34,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:34,179 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-02-05 15:40:34,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:34,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218165449] [2025-02-05 15:40:34,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218165449] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:34,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:34,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:34,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587295748] [2025-02-05 15:40:34,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:34,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:34,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:34,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:34,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:34,182 INFO L87 Difference]: Start difference. First operand 100012 states and 168450 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:37,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:37,629 INFO L93 Difference]: Finished difference Result 187579 states and 316533 transitions. [2025-02-05 15:40:37,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:37,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 174 [2025-02-05 15:40:37,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:38,404 INFO L225 Difference]: With dead ends: 187579 [2025-02-05 15:40:38,405 INFO L226 Difference]: Without dead ends: 187165 [2025-02-05 15:40:38,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:38,493 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 84 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1054 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:38,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1054 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:38,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187165 states. [2025-02-05 15:40:43,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187165 to 187149. [2025-02-05 15:40:43,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187149 states, 157305 states have (on average 1.602161406185436) internal successors, (252028), 157314 states have internal predecessors, (252028), 29794 states have call successors, (29794), 46 states have call predecessors, (29794), 49 states have return successors, (31984), 29792 states have call predecessors, (31984), 29792 states have call successors, (31984) [2025-02-05 15:40:44,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187149 states to 187149 states and 313806 transitions. [2025-02-05 15:40:44,574 INFO L78 Accepts]: Start accepts. Automaton has 187149 states and 313806 transitions. Word has length 174 [2025-02-05 15:40:44,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:44,575 INFO L471 AbstractCegarLoop]: Abstraction has 187149 states and 313806 transitions. [2025-02-05 15:40:44,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (20), 2 states have call predecessors, (20), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-02-05 15:40:44,577 INFO L276 IsEmpty]: Start isEmpty. Operand 187149 states and 313806 transitions. [2025-02-05 15:40:44,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-02-05 15:40:44,825 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:44,825 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 15:40:44,825 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 15:40:44,825 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:44,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:44,826 INFO L85 PathProgramCache]: Analyzing trace with hash 55117381, now seen corresponding path program 1 times [2025-02-05 15:40:44,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:44,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210804596] [2025-02-05 15:40:44,826 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:44,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:44,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 15:40:44,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 15:40:44,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:44,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:45,806 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-02-05 15:40:45,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:45,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210804596] [2025-02-05 15:40:45,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210804596] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:45,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [343170593] [2025-02-05 15:40:45,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:45,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:45,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:45,810 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:40:45,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-05 15:40:46,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-02-05 15:40:46,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-02-05 15:40:46,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:46,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:46,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 1271 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 15:40:46,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:46,351 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-02-05 15:40:46,352 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:40:46,672 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-02-05 15:40:46,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [343170593] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:40:46,673 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:40:46,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 28 [2025-02-05 15:40:46,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554146136] [2025-02-05 15:40:46,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:40:46,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-05 15:40:46,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:46,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-05 15:40:46,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=688, Unknown=0, NotChecked=0, Total=756 [2025-02-05 15:40:46,678 INFO L87 Difference]: Start difference. First operand 187149 states and 313806 transitions. Second operand has 28 states, 26 states have (on average 9.846153846153847) internal successors, (256), 24 states have internal predecessors, (256), 9 states have call successors, (51), 8 states have call predecessors, (51), 12 states have return successors, (46), 11 states have call predecessors, (46), 9 states have call successors, (46)