./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec11_product33.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec11_product33.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 4e977513fd5d8adeea8c73d7c4eeb6cb821e6c768a15a7e6394764a4355fc74d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:50:13,765 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:50:13,811 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:50:13,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:50:13,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:50:13,832 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:50:13,832 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:50:13,833 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:50:13,833 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:50:13,833 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:50:13,833 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:50:13,833 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:50:13,833 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:50:13,834 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:50:13,834 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:50:13,834 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:50:13,834 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:50:13,834 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:50:13,834 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:50:13,834 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:50:13,834 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:50:13,834 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:50:13,834 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:50:13,835 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:50:13,835 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:50:13,835 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:50:13,835 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:50:13,835 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:50:13,835 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:50:13,835 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:50:13,835 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:50:13,835 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:50:13,835 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:50:13,835 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:50:13,836 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:50:13,836 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:50:13,836 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:50:13,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:50:13,836 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:50:13,836 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:50:13,836 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:50:13,836 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:50:13,836 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:50:13,836 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:50:13,836 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:50:13,837 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:50:13,837 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:50:13,837 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:50:13,837 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 -> 4e977513fd5d8adeea8c73d7c4eeb6cb821e6c768a15a7e6394764a4355fc74d [2025-01-09 03:50:14,239 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:50:14,252 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:50:14,254 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:50:14,259 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:50:14,259 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:50:14,260 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec11_product33.cil.c [2025-01-09 03:50:15,519 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad733c640/d7a227b569c6441fa49ae394cd9f3cd5/FLAGc0de291fb [2025-01-09 03:50:15,900 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:50:15,901 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product33.cil.c [2025-01-09 03:50:15,915 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad733c640/d7a227b569c6441fa49ae394cd9f3cd5/FLAGc0de291fb [2025-01-09 03:50:16,104 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/ad733c640/d7a227b569c6441fa49ae394cd9f3cd5 [2025-01-09 03:50:16,105 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:50:16,106 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:50:16,107 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:50:16,107 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:50:16,110 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:50:16,110 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:50:16" (1/1) ... [2025-01-09 03:50:16,111 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1629f19c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:16, skipping insertion in model container [2025-01-09 03:50:16,111 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:50:16" (1/1) ... [2025-01-09 03:50:16,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:50:16,492 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_spec11_product33.cil.c[64763,64776] [2025-01-09 03:50:16,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:50:16,509 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:50:16,514 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2025-01-09 03:50:16,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1128] [2025-01-09 03:50:16,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1288] [2025-01-09 03:50:16,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1305] [2025-01-09 03:50:16,515 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1671] [2025-01-09 03:50:16,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2072] [2025-01-09 03:50:16,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptAutoResponder_spec.i","") [2469] [2025-01-09 03:50:16,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2489] [2025-01-09 03:50:16,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2788] [2025-01-09 03:50:16,516 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3007] [2025-01-09 03:50:16,517 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3042] [2025-01-09 03:50:16,583 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_spec11_product33.cil.c[64763,64776] [2025-01-09 03:50:16,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:50:16,613 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:50:16,614 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:16 WrapperNode [2025-01-09 03:50:16,614 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:50:16,615 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:50:16,616 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:50:16,616 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:50:16,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:16" (1/1) ... [2025-01-09 03:50:16,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:16" (1/1) ... [2025-01-09 03:50:16,696 INFO L138 Inliner]: procedures = 134, calls = 211, calls flagged for inlining = 65, calls inlined = 60, statements flattened = 1070 [2025-01-09 03:50:16,698 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:50:16,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:50:16,698 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:50:16,698 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:50:16,705 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:16" (1/1) ... [2025-01-09 03:50:16,705 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:16" (1/1) ... [2025-01-09 03:50:16,715 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:16" (1/1) ... [2025-01-09 03:50:16,744 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-01-09 03:50:16,748 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:16" (1/1) ... [2025-01-09 03:50:16,749 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:16" (1/1) ... [2025-01-09 03:50:16,775 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:16" (1/1) ... [2025-01-09 03:50:16,776 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:16" (1/1) ... [2025-01-09 03:50:16,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:16" (1/1) ... [2025-01-09 03:50:16,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:16" (1/1) ... [2025-01-09 03:50:16,798 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:16" (1/1) ... [2025-01-09 03:50:16,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:50:16,814 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:50:16,814 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:50:16,814 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:50:16,815 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:16" (1/1) ... [2025-01-09 03:50:16,823 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:50:16,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:16,842 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:50:16,845 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:50:16,859 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:50:16,859 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:50:16,859 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:50:16,859 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:50:16,859 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:50:16,859 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:50:16,859 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:50:16,859 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:50:16,859 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:50:16,859 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:50:16,860 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:50:16,860 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:50:16,860 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:50:16,860 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:50:16,860 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:50:16,860 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:50:16,860 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:50:16,860 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:50:16,860 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:50:16,861 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:50:16,861 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:50:16,861 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:50:16,861 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-01-09 03:50:16,861 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-01-09 03:50:16,861 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:50:16,861 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:50:16,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:50:16,861 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:50:16,861 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:50:16,861 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:50:16,861 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:50:16,861 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:50:16,862 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:50:16,862 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:50:16,862 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:50:16,862 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:50:16,862 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:50:16,862 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:50:16,862 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:50:16,862 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:50:16,862 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:50:16,862 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:50:16,862 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:50:16,862 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:50:16,862 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:50:16,863 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:50:16,863 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:50:16,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:50:16,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:50:16,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:50:16,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:50:16,863 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:50:16,863 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:50:16,863 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:50:16,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:50:16,991 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:50:16,993 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:50:17,791 INFO L? ?]: Removed 500 outVars from TransFormulas that were not future-live. [2025-01-09 03:50:17,791 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:50:17,810 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:50:17,811 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:50:17,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:50:17 BoogieIcfgContainer [2025-01-09 03:50:17,811 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:50:17,813 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:50:17,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:50:17,816 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:50:17,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:50:16" (1/3) ... [2025-01-09 03:50:17,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b01138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:50:17, skipping insertion in model container [2025-01-09 03:50:17,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:50:16" (2/3) ... [2025-01-09 03:50:17,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15b01138 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:50:17, skipping insertion in model container [2025-01-09 03:50:17,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:50:17" (3/3) ... [2025-01-09 03:50:17,818 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec11_product33.cil.c [2025-01-09 03:50:17,827 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:50:17,830 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec11_product33.cil.c that has 25 procedures, 384 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:50:17,885 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:50:17,893 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;@5701c2ea, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:50:17,894 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:50:17,900 INFO L276 IsEmpty]: Start isEmpty. Operand has 384 states, 296 states have (on average 1.5) internal successors, (444), 300 states have internal predecessors, (444), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 03:50:17,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 03:50:17,919 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:17,920 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:17,921 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:17,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:17,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1703339697, now seen corresponding path program 1 times [2025-01-09 03:50:17,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:17,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443113305] [2025-01-09 03:50:17,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:17,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:18,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 03:50:18,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 03:50:18,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:18,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:18,523 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 03:50:18,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:18,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443113305] [2025-01-09 03:50:18,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443113305] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:18,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1802237216] [2025-01-09 03:50:18,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:18,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:18,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:18,529 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:50:18,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:50:18,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 03:50:18,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 03:50:18,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:18,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:18,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 1185 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 03:50:18,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:18,901 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 03:50:18,901 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:50:18,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1802237216] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:18,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:50:18,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-01-09 03:50:18,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396755424] [2025-01-09 03:50:18,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:18,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:50:18,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:18,923 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:50:18,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:50:18,926 INFO L87 Difference]: Start difference. First operand has 384 states, 296 states have (on average 1.5) internal successors, (444), 300 states have internal predecessors, (444), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) Second operand has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:19,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:19,012 INFO L93 Difference]: Finished difference Result 610 states and 884 transitions. [2025-01-09 03:50:19,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:50:19,013 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-01-09 03:50:19,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:19,032 INFO L225 Difference]: With dead ends: 610 [2025-01-09 03:50:19,032 INFO L226 Difference]: Without dead ends: 377 [2025-01-09 03:50:19,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 140 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-01-09 03:50:19,049 INFO L435 NwaCegarLoop]: 565 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, 565 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:19,049 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:19,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-01-09 03:50:19,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2025-01-09 03:50:19,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 290 states have (on average 1.4965517241379311) internal successors, (434), 293 states have internal predecessors, (434), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 03:50:19,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 557 transitions. [2025-01-09 03:50:19,148 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 557 transitions. Word has length 139 [2025-01-09 03:50:19,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:19,151 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 557 transitions. [2025-01-09 03:50:19,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.5) internal successors, (73), 2 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:19,152 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 557 transitions. [2025-01-09 03:50:19,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 03:50:19,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:19,160 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:19,172 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:50:19,361 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-01-09 03:50:19,361 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:19,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:19,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1939006049, now seen corresponding path program 1 times [2025-01-09 03:50:19,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:19,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957076300] [2025-01-09 03:50:19,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:19,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:19,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 03:50:19,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 03:50:19,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:19,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 03:50:19,750 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:19,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957076300] [2025-01-09 03:50:19,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957076300] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:19,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630771361] [2025-01-09 03:50:19,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:19,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:19,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:19,754 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:50:19,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:50:19,905 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 03:50:20,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 03:50:20,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:20,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:20,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 1185 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:50:20,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:20,055 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 03:50:20,055 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:50:20,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630771361] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:20,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:50:20,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:50:20,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043739572] [2025-01-09 03:50:20,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:20,057 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:20,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:20,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:20,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:50:20,058 INFO L87 Difference]: Start difference. First operand 377 states and 557 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:20,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:20,106 INFO L93 Difference]: Finished difference Result 599 states and 865 transitions. [2025-01-09 03:50:20,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:20,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 139 [2025-01-09 03:50:20,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:20,111 INFO L225 Difference]: With dead ends: 599 [2025-01-09 03:50:20,111 INFO L226 Difference]: Without dead ends: 379 [2025-01-09 03:50:20,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:50:20,117 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 1 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:20,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1108 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:20,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2025-01-09 03:50:20,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 378. [2025-01-09 03:50:20,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 291 states have (on average 1.4948453608247423) internal successors, (435), 294 states have internal predecessors, (435), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 03:50:20,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 558 transitions. [2025-01-09 03:50:20,150 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 558 transitions. Word has length 139 [2025-01-09 03:50:20,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:20,150 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 558 transitions. [2025-01-09 03:50:20,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:20,150 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 558 transitions. [2025-01-09 03:50:20,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-01-09 03:50:20,152 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:20,152 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:20,160 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:50:20,352 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-01-09 03:50:20,353 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:20,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:20,353 INFO L85 PathProgramCache]: Analyzing trace with hash -2134548756, now seen corresponding path program 1 times [2025-01-09 03:50:20,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:20,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320904849] [2025-01-09 03:50:20,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:20,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:20,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 03:50:20,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 03:50:20,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:20,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:20,589 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:50:20,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:20,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320904849] [2025-01-09 03:50:20,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320904849] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:20,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322918310] [2025-01-09 03:50:20,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:20,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:20,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:20,594 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:50:20,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:50:20,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-01-09 03:50:20,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-01-09 03:50:20,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:20,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:20,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 1209 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:50:20,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:20,857 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 03:50:20,858 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:50:20,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322918310] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:20,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:50:20,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:50:20,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951379] [2025-01-09 03:50:20,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:20,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:20,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:20,859 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:20,859 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:50:20,859 INFO L87 Difference]: Start difference. First operand 378 states and 558 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:20,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:20,881 INFO L93 Difference]: Finished difference Result 791 states and 1183 transitions. [2025-01-09 03:50:20,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:20,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 147 [2025-01-09 03:50:20,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:20,884 INFO L225 Difference]: With dead ends: 791 [2025-01-09 03:50:20,884 INFO L226 Difference]: Without dead ends: 439 [2025-01-09 03:50:20,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:50:20,885 INFO L435 NwaCegarLoop]: 573 mSDtfsCounter, 115 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1083 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-01-09 03:50:20,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1083 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:20,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2025-01-09 03:50:20,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 431. [2025-01-09 03:50:20,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 333 states have (on average 1.5135135135135136) internal successors, (504), 336 states have internal predecessors, (504), 73 states have call successors, (73), 24 states have call predecessors, (73), 24 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 03:50:20,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 649 transitions. [2025-01-09 03:50:20,909 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 649 transitions. Word has length 147 [2025-01-09 03:50:20,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:20,916 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 649 transitions. [2025-01-09 03:50:20,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:20,917 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 649 transitions. [2025-01-09 03:50:20,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 03:50:20,939 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:20,939 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:20,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:50:21,141 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-01-09 03:50:21,142 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:21,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:21,143 INFO L85 PathProgramCache]: Analyzing trace with hash 432269389, now seen corresponding path program 1 times [2025-01-09 03:50:21,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:21,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434191725] [2025-01-09 03:50:21,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:21,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:21,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 03:50:21,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 03:50:21,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:21,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:21,353 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:50:21,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:21,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434191725] [2025-01-09 03:50:21,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434191725] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:21,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [108360365] [2025-01-09 03:50:21,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:21,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:21,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:21,358 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:50:21,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:50:21,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-09 03:50:21,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-09 03:50:21,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:21,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:21,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:50:21,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:21,685 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:50:21,686 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:50:21,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [108360365] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:21,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:50:21,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:50:21,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1780756622] [2025-01-09 03:50:21,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:21,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:50:21,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:21,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:50:21,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:50:21,690 INFO L87 Difference]: Start difference. First operand 431 states and 649 transitions. Second operand has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:21,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:21,741 INFO L93 Difference]: Finished difference Result 853 states and 1288 transitions. [2025-01-09 03:50:21,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:50:21,741 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 148 [2025-01-09 03:50:21,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:21,744 INFO L225 Difference]: With dead ends: 853 [2025-01-09 03:50:21,744 INFO L226 Difference]: Without dead ends: 433 [2025-01-09 03:50:21,745 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 146 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-01-09 03:50:21,745 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 2 mSDsluCounter, 1636 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2185 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-01-09 03:50:21,746 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2185 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-01-09 03:50:21,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2025-01-09 03:50:21,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 334 states have (on average 1.5119760479041917) internal successors, (505), 338 states have internal predecessors, (505), 73 states have call successors, (73), 24 states have call predecessors, (73), 25 states have return successors, (74), 72 states have call predecessors, (74), 72 states have call successors, (74) [2025-01-09 03:50:21,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 652 transitions. [2025-01-09 03:50:21,775 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 652 transitions. Word has length 148 [2025-01-09 03:50:21,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:21,775 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 652 transitions. [2025-01-09 03:50:21,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.75) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:21,775 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 652 transitions. [2025-01-09 03:50:21,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 03:50:21,780 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:21,781 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:21,799 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:50:21,981 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-01-09 03:50:21,981 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:21,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:21,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1038178430, now seen corresponding path program 1 times [2025-01-09 03:50:21,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:21,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402224622] [2025-01-09 03:50:21,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:21,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:22,002 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 03:50:22,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 03:50:22,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:22,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:22,157 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 03:50:22,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:22,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402224622] [2025-01-09 03:50:22,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [402224622] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:22,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789298916] [2025-01-09 03:50:22,157 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:22,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:22,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:22,163 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:50:22,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:50:22,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 03:50:22,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 03:50:22,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:22,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:22,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 1215 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:50:22,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:22,481 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:50:22,481 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:50:22,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789298916] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:22,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:50:22,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:50:22,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466800040] [2025-01-09 03:50:22,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:22,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:50:22,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:22,483 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:50:22,483 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:50:22,483 INFO L87 Difference]: Start difference. First operand 433 states and 652 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:22,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:22,536 INFO L93 Difference]: Finished difference Result 855 states and 1293 transitions. [2025-01-09 03:50:22,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:50:22,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 149 [2025-01-09 03:50:22,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:22,540 INFO L225 Difference]: With dead ends: 855 [2025-01-09 03:50:22,540 INFO L226 Difference]: Without dead ends: 435 [2025-01-09 03:50:22,541 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 147 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-01-09 03:50:22,542 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 2 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2171 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-01-09 03:50:22,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2171 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:22,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-01-09 03:50:22,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2025-01-09 03:50:22,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 335 states have (on average 1.51044776119403) internal successors, (506), 340 states have internal predecessors, (506), 73 states have call successors, (73), 24 states have call predecessors, (73), 26 states have return successors, (79), 72 states have call predecessors, (79), 72 states have call successors, (79) [2025-01-09 03:50:22,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 658 transitions. [2025-01-09 03:50:22,557 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 658 transitions. Word has length 149 [2025-01-09 03:50:22,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:22,557 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 658 transitions. [2025-01-09 03:50:22,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:22,558 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 658 transitions. [2025-01-09 03:50:22,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 03:50:22,560 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:22,560 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:22,568 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 03:50:22,760 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-01-09 03:50:22,761 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:22,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:22,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1505690396, now seen corresponding path program 1 times [2025-01-09 03:50:22,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:22,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951803384] [2025-01-09 03:50:22,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:22,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:22,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 03:50:22,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 03:50:22,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:22,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:50:22,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:22,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951803384] [2025-01-09 03:50:22,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951803384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:22,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:22,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:50:22,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788587509] [2025-01-09 03:50:22,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:22,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:50:22,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:22,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:50:22,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:50:22,921 INFO L87 Difference]: Start difference. First operand 435 states and 658 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:22,955 INFO L93 Difference]: Finished difference Result 847 states and 1284 transitions. [2025-01-09 03:50:22,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:50:22,955 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 150 [2025-01-09 03:50:22,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:22,958 INFO L225 Difference]: With dead ends: 847 [2025-01-09 03:50:22,958 INFO L226 Difference]: Without dead ends: 435 [2025-01-09 03:50:22,959 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-01-09 03:50:22,960 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 2 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2189 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-01-09 03:50:22,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2189 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:22,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2025-01-09 03:50:22,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 435. [2025-01-09 03:50:22,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 435 states, 335 states have (on average 1.51044776119403) internal successors, (506), 340 states have internal predecessors, (506), 73 states have call successors, (73), 24 states have call predecessors, (73), 26 states have return successors, (78), 72 states have call predecessors, (78), 72 states have call successors, (78) [2025-01-09 03:50:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 657 transitions. [2025-01-09 03:50:22,973 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 657 transitions. Word has length 150 [2025-01-09 03:50:22,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:22,973 INFO L471 AbstractCegarLoop]: Abstraction has 435 states and 657 transitions. [2025-01-09 03:50:22,974 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:22,974 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 657 transitions. [2025-01-09 03:50:22,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 03:50:22,975 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:22,976 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:22,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:50:22,976 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:22,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:22,976 INFO L85 PathProgramCache]: Analyzing trace with hash -606461829, now seen corresponding path program 2 times [2025-01-09 03:50:22,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:22,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160065710] [2025-01-09 03:50:22,977 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:50:22,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:22,996 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 151 statements into 2 equivalence classes. [2025-01-09 03:50:23,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 58 of 151 statements. [2025-01-09 03:50:23,002 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:50:23,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:23,137 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 03:50:23,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:23,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160065710] [2025-01-09 03:50:23,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160065710] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:23,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:23,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:50:23,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720254996] [2025-01-09 03:50:23,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:23,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:50:23,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:23,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:50:23,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:50:23,139 INFO L87 Difference]: Start difference. First operand 435 states and 657 transitions. Second operand has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:23,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:23,563 INFO L93 Difference]: Finished difference Result 1241 states and 1856 transitions. [2025-01-09 03:50:23,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:50:23,563 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 151 [2025-01-09 03:50:23,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:23,591 INFO L225 Difference]: With dead ends: 1241 [2025-01-09 03:50:23,591 INFO L226 Difference]: Without dead ends: 1027 [2025-01-09 03:50:23,592 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:50:23,594 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 1188 mSDsluCounter, 2819 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 3411 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:23,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 3411 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:50:23,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1027 states. [2025-01-09 03:50:23,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1027 to 865. [2025-01-09 03:50:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 865 states, 668 states have (on average 1.5149700598802396) internal successors, (1012), 675 states have internal predecessors, (1012), 144 states have call successors, (144), 49 states have call predecessors, (144), 52 states have return successors, (158), 144 states have call predecessors, (158), 142 states have call successors, (158) [2025-01-09 03:50:23,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 865 states to 865 states and 1314 transitions. [2025-01-09 03:50:23,634 INFO L78 Accepts]: Start accepts. Automaton has 865 states and 1314 transitions. Word has length 151 [2025-01-09 03:50:23,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:23,635 INFO L471 AbstractCegarLoop]: Abstraction has 865 states and 1314 transitions. [2025-01-09 03:50:23,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.375) internal successors, (91), 7 states have internal predecessors, (91), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:23,635 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1314 transitions. [2025-01-09 03:50:23,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 03:50:23,638 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:23,638 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:23,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:50:23,638 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:23,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:23,639 INFO L85 PathProgramCache]: Analyzing trace with hash 452857269, now seen corresponding path program 1 times [2025-01-09 03:50:23,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:23,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261431614] [2025-01-09 03:50:23,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:23,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:23,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 03:50:23,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 03:50:23,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:23,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:23,764 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:50:23,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:23,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261431614] [2025-01-09 03:50:23,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261431614] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:23,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:23,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:50:23,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123379782] [2025-01-09 03:50:23,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:23,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:50:23,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:23,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:50:23,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:50:23,766 INFO L87 Difference]: Start difference. First operand 865 states and 1314 transitions. Second operand has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:23,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:23,814 INFO L93 Difference]: Finished difference Result 1699 states and 2588 transitions. [2025-01-09 03:50:23,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:50:23,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 152 [2025-01-09 03:50:23,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:23,819 INFO L225 Difference]: With dead ends: 1699 [2025-01-09 03:50:23,819 INFO L226 Difference]: Without dead ends: 869 [2025-01-09 03:50:23,821 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-01-09 03:50:23,822 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 1 mSDsluCounter, 1641 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2192 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-01-09 03:50:23,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2192 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:23,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 869 states. [2025-01-09 03:50:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 869 to 869. [2025-01-09 03:50:23,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 670 states have (on average 1.5134328358208955) internal successors, (1014), 679 states have internal predecessors, (1014), 144 states have call successors, (144), 49 states have call predecessors, (144), 54 states have return successors, (161), 144 states have call predecessors, (161), 142 states have call successors, (161) [2025-01-09 03:50:23,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1319 transitions. [2025-01-09 03:50:23,854 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1319 transitions. Word has length 152 [2025-01-09 03:50:23,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:23,854 INFO L471 AbstractCegarLoop]: Abstraction has 869 states and 1319 transitions. [2025-01-09 03:50:23,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:23,855 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1319 transitions. [2025-01-09 03:50:23,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 03:50:23,858 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:23,858 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:23,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:50:23,858 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:23,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:23,859 INFO L85 PathProgramCache]: Analyzing trace with hash -834439407, now seen corresponding path program 1 times [2025-01-09 03:50:23,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:23,859 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1546157776] [2025-01-09 03:50:23,859 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:23,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:23,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 03:50:23,901 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 03:50:23,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:23,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:24,009 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 03:50:24,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:24,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1546157776] [2025-01-09 03:50:24,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1546157776] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:24,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:24,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:50:24,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663600747] [2025-01-09 03:50:24,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:24,010 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:50:24,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:24,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:50:24,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:50:24,011 INFO L87 Difference]: Start difference. First operand 869 states and 1319 transitions. Second operand has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 03:50:24,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:24,123 INFO L93 Difference]: Finished difference Result 1698 states and 2581 transitions. [2025-01-09 03:50:24,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:50:24,124 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 153 [2025-01-09 03:50:24,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:24,128 INFO L225 Difference]: With dead ends: 1698 [2025-01-09 03:50:24,128 INFO L226 Difference]: Without dead ends: 873 [2025-01-09 03:50:24,130 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-01-09 03:50:24,131 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 7 mSDsluCounter, 3217 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3758 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-01-09 03:50:24,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3758 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:50:24,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 873 states. [2025-01-09 03:50:24,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 873 to 871. [2025-01-09 03:50:24,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 871 states, 672 states have (on average 1.5119047619047619) internal successors, (1016), 680 states have internal predecessors, (1016), 144 states have call successors, (144), 50 states have call predecessors, (144), 54 states have return successors, (159), 144 states have call predecessors, (159), 142 states have call successors, (159) [2025-01-09 03:50:24,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 871 states to 871 states and 1319 transitions. [2025-01-09 03:50:24,164 INFO L78 Accepts]: Start accepts. Automaton has 871 states and 1319 transitions. Word has length 153 [2025-01-09 03:50:24,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:24,165 INFO L471 AbstractCegarLoop]: Abstraction has 871 states and 1319 transitions. [2025-01-09 03:50:24,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 03:50:24,165 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1319 transitions. [2025-01-09 03:50:24,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 03:50:24,168 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:24,169 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:24,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:50:24,169 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:24,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:24,169 INFO L85 PathProgramCache]: Analyzing trace with hash 1791713493, now seen corresponding path program 2 times [2025-01-09 03:50:24,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:24,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248327275] [2025-01-09 03:50:24,170 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:50:24,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:24,187 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 154 statements into 2 equivalence classes. [2025-01-09 03:50:24,191 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 61 of 154 statements. [2025-01-09 03:50:24,191 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:50:24,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:24,307 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-09 03:50:24,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:24,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248327275] [2025-01-09 03:50:24,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248327275] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:24,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:24,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:50:24,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725807823] [2025-01-09 03:50:24,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:24,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:50:24,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:24,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:50:24,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:50:24,309 INFO L87 Difference]: Start difference. First operand 871 states and 1319 transitions. Second operand has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:24,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:24,721 INFO L93 Difference]: Finished difference Result 2491 states and 3740 transitions. [2025-01-09 03:50:24,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:50:24,722 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) Word has length 154 [2025-01-09 03:50:24,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:24,732 INFO L225 Difference]: With dead ends: 2491 [2025-01-09 03:50:24,733 INFO L226 Difference]: Without dead ends: 2061 [2025-01-09 03:50:24,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:50:24,736 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 746 mSDsluCounter, 3347 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 771 SdHoareTripleChecker+Valid, 3930 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:24,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [771 Valid, 3930 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:50:24,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2061 states. [2025-01-09 03:50:24,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2061 to 1739. [2025-01-09 03:50:24,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1342 states have (on average 1.5134128166915053) internal successors, (2031), 1360 states have internal predecessors, (2031), 284 states have call successors, (284), 100 states have call predecessors, (284), 112 states have return successors, (340), 286 states have call predecessors, (340), 280 states have call successors, (340) [2025-01-09 03:50:24,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2655 transitions. [2025-01-09 03:50:24,827 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2655 transitions. Word has length 154 [2025-01-09 03:50:24,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:24,827 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2655 transitions. [2025-01-09 03:50:24,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.875) internal successors, (95), 7 states have internal predecessors, (95), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 4 states have call predecessors, (17), 3 states have call successors, (17) [2025-01-09 03:50:24,828 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2655 transitions. [2025-01-09 03:50:24,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 03:50:24,833 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:24,834 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:24,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:50:24,834 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:24,834 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:24,834 INFO L85 PathProgramCache]: Analyzing trace with hash 153739931, now seen corresponding path program 1 times [2025-01-09 03:50:24,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:24,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001423870] [2025-01-09 03:50:24,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:24,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:24,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 03:50:24,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 03:50:24,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:24,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:50:24,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:24,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001423870] [2025-01-09 03:50:24,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001423870] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:24,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1108594302] [2025-01-09 03:50:24,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:24,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:24,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:24,956 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:50:24,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:50:25,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 03:50:25,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 03:50:25,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:25,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:25,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 1220 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:50:25,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:25,246 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 03:50:25,247 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:50:25,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1108594302] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:25,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:50:25,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:50:25,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255867807] [2025-01-09 03:50:25,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:25,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:50:25,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:25,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:50:25,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:50:25,248 INFO L87 Difference]: Start difference. First operand 1739 states and 2655 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:25,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:25,327 INFO L93 Difference]: Finished difference Result 2621 states and 3994 transitions. [2025-01-09 03:50:25,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:50:25,328 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 154 [2025-01-09 03:50:25,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:25,337 INFO L225 Difference]: With dead ends: 2621 [2025-01-09 03:50:25,338 INFO L226 Difference]: Without dead ends: 1743 [2025-01-09 03:50:25,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 152 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-01-09 03:50:25,342 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 1 mSDsluCounter, 1632 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2182 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:25,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2182 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:25,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2025-01-09 03:50:25,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1735. [2025-01-09 03:50:25,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1735 states, 1340 states have (on average 1.5134328358208955) internal successors, (2028), 1358 states have internal predecessors, (2028), 282 states have call successors, (282), 100 states have call predecessors, (282), 112 states have return successors, (338), 284 states have call predecessors, (338), 278 states have call successors, (338) [2025-01-09 03:50:25,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2648 transitions. [2025-01-09 03:50:25,418 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2648 transitions. Word has length 154 [2025-01-09 03:50:25,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:25,418 INFO L471 AbstractCegarLoop]: Abstraction has 1735 states and 2648 transitions. [2025-01-09 03:50:25,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 2 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:25,418 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2648 transitions. [2025-01-09 03:50:25,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 03:50:25,433 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:25,433 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:25,450 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-01-09 03:50:25,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 03:50:25,634 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:25,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:25,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1908886113, now seen corresponding path program 1 times [2025-01-09 03:50:25,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:25,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2514490] [2025-01-09 03:50:25,636 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:25,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:25,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 03:50:25,661 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 03:50:25,661 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:25,661 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:25,797 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 03:50:25,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:25,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2514490] [2025-01-09 03:50:25,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2514490] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:25,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:25,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:50:25,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038584853] [2025-01-09 03:50:25,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:25,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:50:25,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:25,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:50:25,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:50:25,799 INFO L87 Difference]: Start difference. First operand 1735 states and 2648 transitions. Second operand has 8 states, 7 states have (on average 14.0) internal successors, (98), 8 states have internal predecessors, (98), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 03:50:25,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:25,955 INFO L93 Difference]: Finished difference Result 3411 states and 5212 transitions. [2025-01-09 03:50:25,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:50:25,956 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.0) internal successors, (98), 8 states have internal predecessors, (98), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 155 [2025-01-09 03:50:25,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:25,964 INFO L225 Difference]: With dead ends: 3411 [2025-01-09 03:50:25,964 INFO L226 Difference]: Without dead ends: 1743 [2025-01-09 03:50:25,969 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-01-09 03:50:25,970 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 5 mSDsluCounter, 3229 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3772 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:25,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3772 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:50:25,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2025-01-09 03:50:26,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1739. [2025-01-09 03:50:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1739 states, 1344 states have (on average 1.5119047619047619) internal successors, (2032), 1361 states have internal predecessors, (2032), 282 states have call successors, (282), 101 states have call predecessors, (282), 112 states have return successors, (334), 284 states have call predecessors, (334), 278 states have call successors, (334) [2025-01-09 03:50:26,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1739 states to 1739 states and 2648 transitions. [2025-01-09 03:50:26,069 INFO L78 Accepts]: Start accepts. Automaton has 1739 states and 2648 transitions. Word has length 155 [2025-01-09 03:50:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:26,070 INFO L471 AbstractCegarLoop]: Abstraction has 1739 states and 2648 transitions. [2025-01-09 03:50:26,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.0) internal successors, (98), 8 states have internal predecessors, (98), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-01-09 03:50:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 1739 states and 2648 transitions. [2025-01-09 03:50:26,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 03:50:26,075 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:26,076 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:26,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:50:26,076 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:26,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:26,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1856638910, now seen corresponding path program 1 times [2025-01-09 03:50:26,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:26,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869977178] [2025-01-09 03:50:26,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:26,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:26,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 03:50:26,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 03:50:26,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:26,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:26,207 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:50:26,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:26,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869977178] [2025-01-09 03:50:26,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869977178] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:50:26,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [608438287] [2025-01-09 03:50:26,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:26,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:26,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:50:26,210 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-01-09 03:50:26,231 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-01-09 03:50:26,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 03:50:26,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 03:50:26,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:26,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:26,499 INFO L256 TraceCheckSpWp]: Trace formula consists of 1222 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:50:26,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:50:26,533 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:26,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:50:26,636 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:26,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [608438287] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:50:26,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:50:26,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-01-09 03:50:26,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889700410] [2025-01-09 03:50:26,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:50:26,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:50:26,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:26,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:50:26,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:50:26,639 INFO L87 Difference]: Start difference. First operand 1739 states and 2648 transitions. Second operand has 11 states, 10 states have (on average 15.0) internal successors, (150), 11 states have internal predecessors, (150), 4 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) [2025-01-09 03:50:27,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:27,212 INFO L93 Difference]: Finished difference Result 4885 states and 7808 transitions. [2025-01-09 03:50:27,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:50:27,212 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 15.0) internal successors, (150), 11 states have internal predecessors, (150), 4 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) Word has length 156 [2025-01-09 03:50:27,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:27,231 INFO L225 Difference]: With dead ends: 4885 [2025-01-09 03:50:27,232 INFO L226 Difference]: Without dead ends: 3225 [2025-01-09 03:50:27,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-01-09 03:50:27,239 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 1213 mSDsluCounter, 3722 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1213 SdHoareTripleChecker+Valid, 4260 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:50:27,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1213 Valid, 4260 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:50:27,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3225 states. [2025-01-09 03:50:27,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3225 to 3129. [2025-01-09 03:50:27,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3129 states, 2478 states have (on average 1.5714285714285714) internal successors, (3894), 2494 states have internal predecessors, (3894), 538 states have call successors, (538), 102 states have call predecessors, (538), 112 states have return successors, (670), 540 states have call predecessors, (670), 534 states have call successors, (670) [2025-01-09 03:50:27,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3129 states to 3129 states and 5102 transitions. [2025-01-09 03:50:27,414 INFO L78 Accepts]: Start accepts. Automaton has 3129 states and 5102 transitions. Word has length 156 [2025-01-09 03:50:27,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:27,415 INFO L471 AbstractCegarLoop]: Abstraction has 3129 states and 5102 transitions. [2025-01-09 03:50:27,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 15.0) internal successors, (150), 11 states have internal predecessors, (150), 4 states have call successors, (34), 2 states have call predecessors, (34), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) [2025-01-09 03:50:27,415 INFO L276 IsEmpty]: Start isEmpty. Operand 3129 states and 5102 transitions. [2025-01-09 03:50:27,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 03:50:27,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:27,432 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:27,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-09 03:50:27,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:50:27,633 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:27,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:27,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1059686743, now seen corresponding path program 1 times [2025-01-09 03:50:27,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:27,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362721550] [2025-01-09 03:50:27,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:27,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:27,655 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 03:50:27,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 03:50:27,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:27,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:27,699 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:27,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:27,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362721550] [2025-01-09 03:50:27,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362721550] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:27,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:27,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:27,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557437287] [2025-01-09 03:50:27,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:27,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:27,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:27,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:27,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:27,701 INFO L87 Difference]: Start difference. First operand 3129 states and 5102 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:27,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:27,810 INFO L93 Difference]: Finished difference Result 7295 states and 12118 transitions. [2025-01-09 03:50:27,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:27,811 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 160 [2025-01-09 03:50:27,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:27,830 INFO L225 Difference]: With dead ends: 7295 [2025-01-09 03:50:27,830 INFO L226 Difference]: Without dead ends: 4433 [2025-01-09 03:50:27,838 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:27,838 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 112 mSDsluCounter, 547 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1122 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-01-09 03:50:27,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1122 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:27,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4433 states. [2025-01-09 03:50:27,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4433 to 4401. [2025-01-09 03:50:27,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4401 states, 3494 states have (on average 1.5930165998855181) internal successors, (5566), 3510 states have internal predecessors, (5566), 794 states have call successors, (794), 102 states have call predecessors, (794), 112 states have return successors, (1006), 796 states have call predecessors, (1006), 790 states have call successors, (1006) [2025-01-09 03:50:27,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4401 states to 4401 states and 7366 transitions. [2025-01-09 03:50:27,998 INFO L78 Accepts]: Start accepts. Automaton has 4401 states and 7366 transitions. Word has length 160 [2025-01-09 03:50:27,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:27,998 INFO L471 AbstractCegarLoop]: Abstraction has 4401 states and 7366 transitions. [2025-01-09 03:50:27,999 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 4401 states and 7366 transitions. [2025-01-09 03:50:28,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 03:50:28,016 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:28,016 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:28,016 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:50:28,017 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:28,017 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:28,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1047694753, now seen corresponding path program 1 times [2025-01-09 03:50:28,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:28,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929814545] [2025-01-09 03:50:28,017 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:28,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:28,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 03:50:28,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 03:50:28,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:28,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:28,065 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:28,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:28,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929814545] [2025-01-09 03:50:28,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929814545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:28,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:28,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:28,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1346371197] [2025-01-09 03:50:28,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:28,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:28,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:28,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:28,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:28,071 INFO L87 Difference]: Start difference. First operand 4401 states and 7366 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:28,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:28,201 INFO L93 Difference]: Finished difference Result 10447 states and 17626 transitions. [2025-01-09 03:50:28,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:28,201 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 161 [2025-01-09 03:50:28,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:28,236 INFO L225 Difference]: With dead ends: 10447 [2025-01-09 03:50:28,238 INFO L226 Difference]: Without dead ends: 6517 [2025-01-09 03:50:28,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:28,252 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 110 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 1104 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-01-09 03:50:28,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 1104 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:28,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6517 states. [2025-01-09 03:50:28,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6517 to 6485. [2025-01-09 03:50:28,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6485 states, 5198 states have (on average 1.6048480184686418) internal successors, (8342), 5214 states have internal predecessors, (8342), 1174 states have call successors, (1174), 102 states have call predecessors, (1174), 112 states have return successors, (1450), 1176 states have call predecessors, (1450), 1170 states have call successors, (1450) [2025-01-09 03:50:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6485 states to 6485 states and 10966 transitions. [2025-01-09 03:50:28,681 INFO L78 Accepts]: Start accepts. Automaton has 6485 states and 10966 transitions. Word has length 161 [2025-01-09 03:50:28,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:28,682 INFO L471 AbstractCegarLoop]: Abstraction has 6485 states and 10966 transitions. [2025-01-09 03:50:28,682 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:28,682 INFO L276 IsEmpty]: Start isEmpty. Operand 6485 states and 10966 transitions. [2025-01-09 03:50:28,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 03:50:28,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:28,713 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:28,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:50:28,713 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:28,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:28,714 INFO L85 PathProgramCache]: Analyzing trace with hash -1778177883, now seen corresponding path program 1 times [2025-01-09 03:50:28,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:28,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656060103] [2025-01-09 03:50:28,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:28,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:28,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 03:50:28,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 03:50:28,737 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:28,737 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:28,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:28,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656060103] [2025-01-09 03:50:28,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656060103] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:28,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:28,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:28,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207221294] [2025-01-09 03:50:28,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:28,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:28,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:28,769 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:28,769 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:28,769 INFO L87 Difference]: Start difference. First operand 6485 states and 10966 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:28,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:28,989 INFO L93 Difference]: Finished difference Result 15163 states and 25890 transitions. [2025-01-09 03:50:28,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:28,990 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 162 [2025-01-09 03:50:28,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:29,033 INFO L225 Difference]: With dead ends: 15163 [2025-01-09 03:50:29,033 INFO L226 Difference]: Without dead ends: 9673 [2025-01-09 03:50:29,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-01-09 03:50:29,056 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 108 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 1101 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-01-09 03:50:29,056 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 1101 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:29,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9673 states. [2025-01-09 03:50:29,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9673 to 9641. [2025-01-09 03:50:29,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9641 states, 7862 states have (on average 1.614093106079878) internal successors, (12690), 7878 states have internal predecessors, (12690), 1666 states have call successors, (1666), 102 states have call predecessors, (1666), 112 states have return successors, (2110), 1668 states have call predecessors, (2110), 1662 states have call successors, (2110) [2025-01-09 03:50:29,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9641 states to 9641 states and 16466 transitions. [2025-01-09 03:50:29,522 INFO L78 Accepts]: Start accepts. Automaton has 9641 states and 16466 transitions. Word has length 162 [2025-01-09 03:50:29,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:29,522 INFO L471 AbstractCegarLoop]: Abstraction has 9641 states and 16466 transitions. [2025-01-09 03:50:29,523 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:29,523 INFO L276 IsEmpty]: Start isEmpty. Operand 9641 states and 16466 transitions. [2025-01-09 03:50:29,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 03:50:29,567 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:29,567 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:29,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:50:29,567 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:29,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:29,569 INFO L85 PathProgramCache]: Analyzing trace with hash 92170304, now seen corresponding path program 1 times [2025-01-09 03:50:29,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:29,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252171623] [2025-01-09 03:50:29,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:29,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:29,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 03:50:29,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 03:50:29,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:29,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:29,629 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:29,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:29,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252171623] [2025-01-09 03:50:29,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252171623] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:29,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:29,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:29,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167396849] [2025-01-09 03:50:29,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:29,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:29,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:29,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:29,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:29,631 INFO L87 Difference]: Start difference. First operand 9641 states and 16466 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:29,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:29,992 INFO L93 Difference]: Finished difference Result 22515 states and 38798 transitions. [2025-01-09 03:50:29,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:29,993 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 163 [2025-01-09 03:50:29,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:30,060 INFO L225 Difference]: With dead ends: 22515 [2025-01-09 03:50:30,061 INFO L226 Difference]: Without dead ends: 14717 [2025-01-09 03:50:30,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:30,090 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 106 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1101 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-01-09 03:50:30,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1101 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:30,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14717 states. [2025-01-09 03:50:30,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14717 to 14685. [2025-01-09 03:50:30,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14685 states, 12190 states have (on average 1.620180475799836) internal successors, (19750), 12206 states have internal predecessors, (19750), 2382 states have call successors, (2382), 102 states have call predecessors, (2382), 112 states have return successors, (3106), 2384 states have call predecessors, (3106), 2378 states have call successors, (3106) [2025-01-09 03:50:30,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14685 states to 14685 states and 25238 transitions. [2025-01-09 03:50:30,724 INFO L78 Accepts]: Start accepts. Automaton has 14685 states and 25238 transitions. Word has length 163 [2025-01-09 03:50:30,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:30,724 INFO L471 AbstractCegarLoop]: Abstraction has 14685 states and 25238 transitions. [2025-01-09 03:50:30,725 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:30,725 INFO L276 IsEmpty]: Start isEmpty. Operand 14685 states and 25238 transitions. [2025-01-09 03:50:30,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 03:50:30,773 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:30,773 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:30,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:50:30,773 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:30,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:30,774 INFO L85 PathProgramCache]: Analyzing trace with hash 500989473, now seen corresponding path program 1 times [2025-01-09 03:50:30,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:30,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332962620] [2025-01-09 03:50:30,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:30,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:30,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 03:50:30,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 03:50:30,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:30,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:30,824 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:30,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:30,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332962620] [2025-01-09 03:50:30,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332962620] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:30,825 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:30,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:30,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724500719] [2025-01-09 03:50:30,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:30,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:30,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:30,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:30,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:30,826 INFO L87 Difference]: Start difference. First operand 14685 states and 25238 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:31,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:31,285 INFO L93 Difference]: Finished difference Result 34619 states and 60034 transitions. [2025-01-09 03:50:31,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:31,286 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 164 [2025-01-09 03:50:31,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:31,377 INFO L225 Difference]: With dead ends: 34619 [2025-01-09 03:50:31,377 INFO L226 Difference]: Without dead ends: 23061 [2025-01-09 03:50:31,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:31,410 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 104 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 1122 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-01-09 03:50:31,410 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 1122 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:31,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23061 states. [2025-01-09 03:50:32,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23061 to 23029. [2025-01-09 03:50:32,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23029 states, 19030 states have (on average 1.6160798738833422) internal successors, (30754), 19046 states have internal predecessors, (30754), 3886 states have call successors, (3886), 102 states have call predecessors, (3886), 112 states have return successors, (5098), 3888 states have call predecessors, (5098), 3882 states have call successors, (5098) [2025-01-09 03:50:32,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23029 states to 23029 states and 39738 transitions. [2025-01-09 03:50:32,554 INFO L78 Accepts]: Start accepts. Automaton has 23029 states and 39738 transitions. Word has length 164 [2025-01-09 03:50:32,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:32,555 INFO L471 AbstractCegarLoop]: Abstraction has 23029 states and 39738 transitions. [2025-01-09 03:50:32,555 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:32,555 INFO L276 IsEmpty]: Start isEmpty. Operand 23029 states and 39738 transitions. [2025-01-09 03:50:32,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 03:50:32,638 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:32,638 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:32,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:50:32,639 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:32,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:32,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1706225980, now seen corresponding path program 1 times [2025-01-09 03:50:32,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:32,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109109374] [2025-01-09 03:50:32,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:32,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:32,660 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 03:50:32,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 03:50:32,667 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:32,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:32,702 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:32,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:32,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109109374] [2025-01-09 03:50:32,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109109374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:32,703 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:32,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:32,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116942810] [2025-01-09 03:50:32,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:32,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:32,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:32,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:32,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:32,705 INFO L87 Difference]: Start difference. First operand 23029 states and 39738 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:33,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:33,637 INFO L93 Difference]: Finished difference Result 56555 states and 98022 transitions. [2025-01-09 03:50:33,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:33,637 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 165 [2025-01-09 03:50:33,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:33,787 INFO L225 Difference]: With dead ends: 56555 [2025-01-09 03:50:33,787 INFO L226 Difference]: Without dead ends: 38197 [2025-01-09 03:50:33,980 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:33,980 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 102 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 1112 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-01-09 03:50:33,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 1112 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:33,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38197 states. [2025-01-09 03:50:34,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38197 to 38165. [2025-01-09 03:50:34,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38165 states, 31742 states have (on average 1.6147060676705942) internal successors, (51254), 31758 states have internal predecessors, (51254), 6310 states have call successors, (6310), 102 states have call predecessors, (6310), 112 states have return successors, (8122), 6312 states have call predecessors, (8122), 6306 states have call successors, (8122) [2025-01-09 03:50:35,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38165 states to 38165 states and 65686 transitions. [2025-01-09 03:50:35,101 INFO L78 Accepts]: Start accepts. Automaton has 38165 states and 65686 transitions. Word has length 165 [2025-01-09 03:50:35,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:35,102 INFO L471 AbstractCegarLoop]: Abstraction has 38165 states and 65686 transitions. [2025-01-09 03:50:35,102 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:35,102 INFO L276 IsEmpty]: Start isEmpty. Operand 38165 states and 65686 transitions. [2025-01-09 03:50:35,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 03:50:35,208 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:35,208 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:35,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:50:35,208 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:35,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:35,209 INFO L85 PathProgramCache]: Analyzing trace with hash -1309513777, now seen corresponding path program 1 times [2025-01-09 03:50:35,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:35,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194460672] [2025-01-09 03:50:35,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:35,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:35,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 03:50:35,231 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 03:50:35,231 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:35,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:35,258 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:35,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:35,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194460672] [2025-01-09 03:50:35,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1194460672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:35,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:35,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:35,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692520702] [2025-01-09 03:50:35,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:35,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:35,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:35,259 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:35,259 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:35,259 INFO L87 Difference]: Start difference. First operand 38165 states and 65686 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:36,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:36,929 INFO L93 Difference]: Finished difference Result 98439 states and 170194 transitions. [2025-01-09 03:50:36,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:36,929 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 166 [2025-01-09 03:50:36,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:37,248 INFO L225 Difference]: With dead ends: 98439 [2025-01-09 03:50:37,249 INFO L226 Difference]: Without dead ends: 66785 [2025-01-09 03:50:37,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:37,363 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 100 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1116 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-01-09 03:50:37,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1116 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:37,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66785 states. [2025-01-09 03:50:39,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66785 to 66753. [2025-01-09 03:50:39,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66753 states, 55518 states have (on average 1.6062178032349868) internal successors, (89174), 55534 states have internal predecessors, (89174), 11122 states have call successors, (11122), 102 states have call predecessors, (11122), 112 states have return successors, (14346), 11124 states have call predecessors, (14346), 11118 states have call successors, (14346) [2025-01-09 03:50:40,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66753 states to 66753 states and 114642 transitions. [2025-01-09 03:50:40,060 INFO L78 Accepts]: Start accepts. Automaton has 66753 states and 114642 transitions. Word has length 166 [2025-01-09 03:50:40,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:40,061 INFO L471 AbstractCegarLoop]: Abstraction has 66753 states and 114642 transitions. [2025-01-09 03:50:40,061 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:40,061 INFO L276 IsEmpty]: Start isEmpty. Operand 66753 states and 114642 transitions. [2025-01-09 03:50:40,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 03:50:40,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:40,229 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:40,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:50:40,229 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:40,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:40,229 INFO L85 PathProgramCache]: Analyzing trace with hash -472902203, now seen corresponding path program 1 times [2025-01-09 03:50:40,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:40,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143719095] [2025-01-09 03:50:40,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:40,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:40,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 03:50:40,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 03:50:40,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:40,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:40,283 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:40,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:40,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143719095] [2025-01-09 03:50:40,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143719095] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:40,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:40,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:40,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396178336] [2025-01-09 03:50:40,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:40,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:40,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:40,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:40,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:40,285 INFO L87 Difference]: Start difference. First operand 66753 states and 114642 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:43,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:43,005 INFO L93 Difference]: Finished difference Result 176583 states and 304746 transitions. [2025-01-09 03:50:43,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:43,006 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 167 [2025-01-09 03:50:43,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:50:43,569 INFO L225 Difference]: With dead ends: 176583 [2025-01-09 03:50:43,569 INFO L226 Difference]: Without dead ends: 118933 [2025-01-09 03:50:43,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:43,776 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 98 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1104 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-01-09 03:50:43,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1104 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:50:43,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118933 states. [2025-01-09 03:50:48,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118933 to 118901. [2025-01-09 03:50:48,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118901 states, 99510 states have (on average 1.601989749773892) internal successors, (159414), 99526 states have internal predecessors, (159414), 19278 states have call successors, (19278), 102 states have call predecessors, (19278), 112 states have return successors, (25210), 19280 states have call predecessors, (25210), 19274 states have call successors, (25210) [2025-01-09 03:50:48,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118901 states to 118901 states and 203902 transitions. [2025-01-09 03:50:48,903 INFO L78 Accepts]: Start accepts. Automaton has 118901 states and 203902 transitions. Word has length 167 [2025-01-09 03:50:48,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:50:48,904 INFO L471 AbstractCegarLoop]: Abstraction has 118901 states and 203902 transitions. [2025-01-09 03:50:48,904 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:48,904 INFO L276 IsEmpty]: Start isEmpty. Operand 118901 states and 203902 transitions. [2025-01-09 03:50:49,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-01-09 03:50:49,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:50:49,216 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:50:49,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:50:49,216 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:50:49,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:50:49,216 INFO L85 PathProgramCache]: Analyzing trace with hash 1984043761, now seen corresponding path program 1 times [2025-01-09 03:50:49,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:50:49,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866142018] [2025-01-09 03:50:49,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:50:49,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:50:49,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-01-09 03:50:49,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-01-09 03:50:49,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:50:49,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:50:49,271 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2025-01-09 03:50:49,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:50:49,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866142018] [2025-01-09 03:50:49,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866142018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:50:49,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:50:49,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:50:49,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071202278] [2025-01-09 03:50:49,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:50:49,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:50:49,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:50:49,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:50:49,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:50:49,273 INFO L87 Difference]: Start difference. First operand 118901 states and 203902 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-01-09 03:50:54,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:50:54,019 INFO L93 Difference]: Finished difference Result 324191 states and 555834 transitions. [2025-01-09 03:50:54,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:50:54,019 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, (19), 2 states have call predecessors, (19), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 168 [2025-01-09 03:50:54,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted.