./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec1_product31.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec1_product31.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 ca4739abfecd00b8d2b799ccc2617c6e4b4e221f88b8a7e722070835771a8404 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:21:41,204 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:21:41,261 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:21:41,264 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:21:41,264 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:21:41,284 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:21:41,285 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:21:41,285 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:21:41,286 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:21:41,286 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:21:41,286 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:21:41,287 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:21:41,287 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:21:41,287 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:21:41,287 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:21:41,287 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:21:41,287 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:21:41,287 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:21:41,287 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:21:41,287 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:21:41,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:21:41,288 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:21:41,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:21:41,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:21:41,288 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:21:41,288 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:21:41,288 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:21:41,288 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:21:41,288 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:21:41,288 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:21:41,289 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:21:41,289 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:21:41,289 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:21:41,289 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:21:41,289 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:21:41,289 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:21:41,289 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:21:41,289 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:21:41,290 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:21:41,290 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:21:41,290 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:21:41,290 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:21:41,290 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:21:41,290 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/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 -> ca4739abfecd00b8d2b799ccc2617c6e4b4e221f88b8a7e722070835771a8404 [2025-03-03 14:21:41,509 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:21:41,514 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:21:41,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:21:41,516 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:21:41,516 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:21:41,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec1_product31.cil.c [2025-03-03 14:21:42,636 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9a2d3aa/ee6bf2a1c0b44717bf480af041902fdc/FLAG52bcb717d [2025-03-03 14:21:43,009 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:21:43,010 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product31.cil.c [2025-03-03 14:21:43,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9a2d3aa/ee6bf2a1c0b44717bf480af041902fdc/FLAG52bcb717d [2025-03-03 14:21:43,210 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ed9a2d3aa/ee6bf2a1c0b44717bf480af041902fdc [2025-03-03 14:21:43,212 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:21:43,214 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:21:43,215 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:21:43,215 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:21:43,218 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:21:43,219 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:21:43" (1/1) ... [2025-03-03 14:21:43,219 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48c12871 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:43, skipping insertion in model container [2025-03-03 14:21:43,220 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:21:43" (1/1) ... [2025-03-03 14:21:43,263 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:21:43,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product31.cil.c[64142,64155] [2025-03-03 14:21:43,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:21:43,756 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:21:43,762 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2025-03-03 14:21:43,763 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [66] [2025-03-03 14:21:43,763 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [108] [2025-03-03 14:21:43,763 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [489] [2025-03-03 14:21:43,764 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [855] [2025-03-03 14:21:43,764 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [992] [2025-03-03 14:21:43,764 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1217] [2025-03-03 14:21:43,765 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1255] [2025-03-03 14:21:43,765 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1537] [2025-03-03 14:21:43,765 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1934] [2025-03-03 14:21:43,765 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3001] [2025-03-03 14:21:43,869 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product31.cil.c[64142,64155] [2025-03-03 14:21:43,871 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:21:43,899 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:21:43,900 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:43 WrapperNode [2025-03-03 14:21:43,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:21:43,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:21:43,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:21:43,902 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:21:43,906 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:43" (1/1) ... [2025-03-03 14:21:43,932 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:43" (1/1) ... [2025-03-03 14:21:43,981 INFO L138 Inliner]: procedures = 131, calls = 204, calls flagged for inlining = 61, calls inlined = 56, statements flattened = 1026 [2025-03-03 14:21:43,981 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:21:43,981 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:21:43,985 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:21:43,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:21:43,992 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:43" (1/1) ... [2025-03-03 14:21:43,993 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:43" (1/1) ... [2025-03-03 14:21:44,000 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:43" (1/1) ... [2025-03-03 14:21:44,021 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-03-03 14:21:44,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:43" (1/1) ... [2025-03-03 14:21:44,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:43" (1/1) ... [2025-03-03 14:21:44,034 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:43" (1/1) ... [2025-03-03 14:21:44,035 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:43" (1/1) ... [2025-03-03 14:21:44,038 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:43" (1/1) ... [2025-03-03 14:21:44,039 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:43" (1/1) ... [2025-03-03 14:21:44,043 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:21:44,044 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:21:44,044 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:21:44,044 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:21:44,045 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:43" (1/1) ... [2025-03-03 14:21:44,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:21:44,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:21:44,071 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:21:44,073 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:21:44,088 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-03 14:21:44,088 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-03 14:21:44,088 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:21:44,088 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:21:44,088 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:21:44,088 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:21:44,088 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:21:44,088 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:21:44,088 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:21:44,088 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:21:44,088 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:21:44,088 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:21:44,088 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:21:44,088 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:21:44,088 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:21:44,088 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:21:44,089 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:21:44,090 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:21:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:21:44,090 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:21:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:21:44,090 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:21:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:21:44,090 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:21:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:21:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:21:44,090 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:21:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:21:44,090 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:21:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:21:44,090 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:21:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:21:44,090 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:21:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:21:44,090 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:21:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:21:44,090 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:21:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:21:44,090 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:21:44,090 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:21:44,090 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:21:44,091 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:21:44,091 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:21:44,091 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:21:44,091 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:21:44,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:21:44,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:21:44,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:21:44,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:21:44,091 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:21:44,091 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:21:44,091 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:21:44,091 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:21:44,244 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:21:44,246 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:21:44,494 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2978-1: getClientId_#res#1 := getClientId_~retValue_acc~43#1; [2025-03-03 14:21:44,494 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1915-1: isVerified_#res#1 := isVerified_~retValue_acc~26#1; [2025-03-03 14:21:44,494 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2931-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~42#1; [2025-03-03 14:21:44,494 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1578-1: getEmailId_#res#1 := getEmailId_~retValue_acc~17#1; [2025-03-03 14:21:44,501 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1841: #res := ~retValue_acc~24; [2025-03-03 14:21:44,513 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L395: #res := ~retValue_acc~5; [2025-03-03 14:21:44,538 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2590-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~37#1; [2025-03-03 14:21:44,539 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2635: #res#1 := ~retValue_acc~38#1; [2025-03-03 14:21:44,560 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2859: #res := ~retValue_acc~41; [2025-03-03 14:21:44,567 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2543: #res := ~retValue_acc~36; [2025-03-03 14:21:44,574 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-1: createEmail_#res#1 := createEmail_~retValue_acc~12#1; [2025-03-03 14:21:44,585 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1767: #res := ~retValue_acc~22; [2025-03-03 14:21:44,593 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1804: #res := ~retValue_acc~23; [2025-03-03 14:21:44,598 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1878: #res := ~retValue_acc~25; [2025-03-03 14:21:44,614 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1652: #res := ~retValue_acc~19; [2025-03-03 14:21:44,833 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1252-1: valid_product_#res#1 := valid_product_~retValue_acc~14#1; [2025-03-03 14:21:44,834 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L352-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~2#1; [2025-03-03 14:21:44,834 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2805-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~40#1; [2025-03-03 14:21:44,834 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L361-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~3#1; [2025-03-03 14:21:44,834 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2698-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~39#1; [2025-03-03 14:21:44,834 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L370-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~4#1; [2025-03-03 14:21:44,839 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1615: #res := ~retValue_acc~18; [2025-03-03 14:21:44,849 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L945-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~9#1; [2025-03-03 14:21:44,849 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L965: #res#1 := ~retValue_acc~10#1; [2025-03-03 14:21:44,958 INFO L? ?]: Removed 476 outVars from TransFormulas that were not future-live. [2025-03-03 14:21:44,959 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:21:44,976 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:21:44,976 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:21:44,976 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:21:44 BoogieIcfgContainer [2025-03-03 14:21:44,976 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:21:44,978 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:21:44,978 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:21:44,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:21:44,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:21:43" (1/3) ... [2025-03-03 14:21:44,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7092adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:21:44, skipping insertion in model container [2025-03-03 14:21:44,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:21:43" (2/3) ... [2025-03-03 14:21:44,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7092adf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:21:44, skipping insertion in model container [2025-03-03 14:21:44,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:21:44" (3/3) ... [2025-03-03 14:21:44,986 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec1_product31.cil.c [2025-03-03 14:21:44,995 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:21:44,998 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec1_product31.cil.c that has 24 procedures, 368 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:21:45,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:21:45,046 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;@dec2aaf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:21:45,046 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:21:45,050 INFO L276 IsEmpty]: Start isEmpty. Operand has 368 states, 284 states have (on average 1.5) internal successors, (426), 288 states have internal predecessors, (426), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-03 14:21:45,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 14:21:45,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:45,060 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-03-03 14:21:45,060 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:45,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:45,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1553099004, now seen corresponding path program 1 times [2025-03-03 14:21:45,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:45,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953996763] [2025-03-03 14:21:45,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:45,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:45,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 14:21:45,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 14:21:45,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:45,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:45,617 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:21:45,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:45,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953996763] [2025-03-03 14:21:45,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953996763] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:21:45,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1876967466] [2025-03-03 14:21:45,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:45,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:45,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:21:45,620 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:21:45,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:21:45,761 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 14:21:45,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 14:21:45,881 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:45,881 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:45,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 1016 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:21:45,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:21:45,916 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:21:45,916 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:21:45,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1876967466] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:45,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:21:45,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:21:45,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24396216] [2025-03-03 14:21:45,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:45,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:21:45,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:45,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:21:45,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:21:45,957 INFO L87 Difference]: Start difference. First operand has 368 states, 284 states have (on average 1.5) internal successors, (426), 288 states have internal predecessors, (426), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:46,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:46,004 INFO L93 Difference]: Finished difference Result 583 states and 844 transitions. [2025-03-03 14:21:46,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:21:46,006 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 101 [2025-03-03 14:21:46,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:46,014 INFO L225 Difference]: With dead ends: 583 [2025-03-03 14:21:46,014 INFO L226 Difference]: Without dead ends: 361 [2025-03-03 14:21:46,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 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-03-03 14:21:46,019 INFO L435 NwaCegarLoop]: 541 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, 541 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-03-03 14:21:46,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:46,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2025-03-03 14:21:46,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2025-03-03 14:21:46,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 278 states have (on average 1.4964028776978417) internal successors, (416), 281 states have internal predecessors, (416), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 14:21:46,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 533 transitions. [2025-03-03 14:21:46,068 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 533 transitions. Word has length 101 [2025-03-03 14:21:46,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:46,069 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 533 transitions. [2025-03-03 14:21:46,069 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 533 transitions. [2025-03-03 14:21:46,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:21:46,075 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:46,075 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-03-03 14:21:46,083 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:21:46,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:21:46,278 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:46,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:46,278 INFO L85 PathProgramCache]: Analyzing trace with hash -2052877200, now seen corresponding path program 1 times [2025-03-03 14:21:46,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:46,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947483659] [2025-03-03 14:21:46,278 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:46,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:46,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:21:46,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:21:46,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:46,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:46,498 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:21:46,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:46,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947483659] [2025-03-03 14:21:46,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947483659] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:21:46,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [420648782] [2025-03-03 14:21:46,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:46,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:46,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:21:46,501 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:21:46,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:21:46,646 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:21:46,768 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:21:46,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:46,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:46,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 1017 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:21:46,777 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:21:46,807 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:21:46,809 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:21:46,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [420648782] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:46,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:21:46,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:21:46,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1021857128] [2025-03-03 14:21:46,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:46,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:46,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:46,811 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:46,811 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:21:46,811 INFO L87 Difference]: Start difference. First operand 361 states and 533 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:46,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:46,850 INFO L93 Difference]: Finished difference Result 572 states and 825 transitions. [2025-03-03 14:21:46,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:46,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 102 [2025-03-03 14:21:46,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:46,855 INFO L225 Difference]: With dead ends: 572 [2025-03-03 14:21:46,855 INFO L226 Difference]: Without dead ends: 363 [2025-03-03 14:21:46,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 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-03-03 14:21:46,857 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 0 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1062 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:46,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1062 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:46,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2025-03-03 14:21:46,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 363. [2025-03-03 14:21:46,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 280 states have (on average 1.4928571428571429) internal successors, (418), 283 states have internal predecessors, (418), 59 states have call successors, (59), 23 states have call predecessors, (59), 23 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 14:21:46,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 535 transitions. [2025-03-03 14:21:46,873 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 535 transitions. Word has length 102 [2025-03-03 14:21:46,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:46,874 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 535 transitions. [2025-03-03 14:21:46,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:46,874 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 535 transitions. [2025-03-03 14:21:46,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 14:21:46,878 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:46,878 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-03-03 14:21:46,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:21:47,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:21:47,081 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:47,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:47,082 INFO L85 PathProgramCache]: Analyzing trace with hash -340437753, now seen corresponding path program 1 times [2025-03-03 14:21:47,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:47,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893004016] [2025-03-03 14:21:47,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:47,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:47,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 14:21:47,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 14:21:47,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:47,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:21:47,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:47,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893004016] [2025-03-03 14:21:47,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893004016] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:21:47,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047683496] [2025-03-03 14:21:47,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:47,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:47,235 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:21:47,237 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:21:47,239 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:21:47,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 14:21:47,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 14:21:47,472 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:47,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:47,476 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:21:47,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:21:47,503 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:21:47,505 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:21:47,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047683496] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:47,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:21:47,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:21:47,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068202455] [2025-03-03 14:21:47,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:47,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:47,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:47,508 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:47,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:21:47,509 INFO L87 Difference]: Start difference. First operand 363 states and 535 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:47,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:47,544 INFO L93 Difference]: Finished difference Result 755 states and 1128 transitions. [2025-03-03 14:21:47,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:47,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 107 [2025-03-03 14:21:47,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:47,549 INFO L225 Difference]: With dead ends: 755 [2025-03-03 14:21:47,549 INFO L226 Difference]: Without dead ends: 419 [2025-03-03 14:21:47,551 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 107 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-03-03 14:21:47,551 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 107 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 1028 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-03-03 14:21:47,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 1028 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:47,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-03 14:21:47,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 411. [2025-03-03 14:21:47,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 317 states have (on average 1.5110410094637223) internal successors, (479), 320 states have internal predecessors, (479), 70 states have call successors, (70), 23 states have call predecessors, (70), 23 states have return successors, (69), 69 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-03 14:21:47,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 618 transitions. [2025-03-03 14:21:47,579 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 618 transitions. Word has length 107 [2025-03-03 14:21:47,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:47,579 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 618 transitions. [2025-03-03 14:21:47,579 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:47,579 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 618 transitions. [2025-03-03 14:21:47,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:21:47,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:47,581 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-03-03 14:21:47,588 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:21:47,781 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:47,782 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:47,782 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:47,782 INFO L85 PathProgramCache]: Analyzing trace with hash 1745173301, now seen corresponding path program 1 times [2025-03-03 14:21:47,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:47,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068143772] [2025-03-03 14:21:47,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:47,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:47,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:21:47,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:21:47,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:47,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:47,907 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:21:47,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:47,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068143772] [2025-03-03 14:21:47,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068143772] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:21:47,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2128246569] [2025-03-03 14:21:47,908 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:47,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:47,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:21:47,910 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:21:47,912 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:21:48,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:21:48,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:21:48,148 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:48,148 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:48,152 INFO L256 TraceCheckSpWp]: Trace formula consists of 1034 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:21:48,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:21:48,194 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:21:48,195 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:21:48,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2128246569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:48,195 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:21:48,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:21:48,195 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893049021] [2025-03-03 14:21:48,195 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:48,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:21:48,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:48,196 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:21:48,196 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:21:48,197 INFO L87 Difference]: Start difference. First operand 411 states and 618 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:48,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:48,260 INFO L93 Difference]: Finished difference Result 813 states and 1226 transitions. [2025-03-03 14:21:48,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:21:48,261 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 108 [2025-03-03 14:21:48,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:48,264 INFO L225 Difference]: With dead ends: 813 [2025-03-03 14:21:48,264 INFO L226 Difference]: Without dead ends: 413 [2025-03-03 14:21:48,266 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 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-03-03 14:21:48,266 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 2 mSDsluCounter, 1564 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2089 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-03-03 14:21:48,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2089 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:48,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-03 14:21:48,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-03-03 14:21:48,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 318 states have (on average 1.509433962264151) internal successors, (480), 322 states have internal predecessors, (480), 70 states have call successors, (70), 23 states have call predecessors, (70), 24 states have return successors, (71), 69 states have call predecessors, (71), 69 states have call successors, (71) [2025-03-03 14:21:48,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 621 transitions. [2025-03-03 14:21:48,290 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 621 transitions. Word has length 108 [2025-03-03 14:21:48,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:48,290 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 621 transitions. [2025-03-03 14:21:48,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:48,291 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 621 transitions. [2025-03-03 14:21:48,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:21:48,293 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:48,293 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2025-03-03 14:21:48,302 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:21:48,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:48,497 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:48,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:48,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1018599103, now seen corresponding path program 1 times [2025-03-03 14:21:48,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:48,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13248040] [2025-03-03 14:21:48,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:48,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:48,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:21:48,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:21:48,530 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:48,530 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:48,642 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:21:48,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:48,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13248040] [2025-03-03 14:21:48,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [13248040] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:21:48,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1597282755] [2025-03-03 14:21:48,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:48,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:48,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:21:48,645 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:21:48,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:21:48,769 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:21:48,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:21:48,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:48,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:48,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:21:48,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:21:48,922 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:21:48,924 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:21:48,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1597282755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:48,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:21:48,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:21:48,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246113149] [2025-03-03 14:21:48,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:48,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:21:48,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:48,925 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:21:48,926 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:21:48,926 INFO L87 Difference]: Start difference. First operand 413 states and 621 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:48,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:48,989 INFO L93 Difference]: Finished difference Result 815 states and 1231 transitions. [2025-03-03 14:21:48,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:21:48,990 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 109 [2025-03-03 14:21:48,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:48,992 INFO L225 Difference]: With dead ends: 815 [2025-03-03 14:21:48,992 INFO L226 Difference]: Without dead ends: 415 [2025-03-03 14:21:48,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 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-03-03 14:21:48,996 INFO L435 NwaCegarLoop]: 523 mSDtfsCounter, 2 mSDsluCounter, 1552 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2075 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-03-03 14:21:48,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2075 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:48,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-03 14:21:49,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2025-03-03 14:21:49,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 319 states have (on average 1.5078369905956113) internal successors, (481), 324 states have internal predecessors, (481), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (76), 69 states have call predecessors, (76), 69 states have call successors, (76) [2025-03-03 14:21:49,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 627 transitions. [2025-03-03 14:21:49,011 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 627 transitions. Word has length 109 [2025-03-03 14:21:49,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:49,011 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 627 transitions. [2025-03-03 14:21:49,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:49,011 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 627 transitions. [2025-03-03 14:21:49,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:21:49,012 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:49,013 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:49,020 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:21:49,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:49,213 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:49,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:49,214 INFO L85 PathProgramCache]: Analyzing trace with hash -676612505, now seen corresponding path program 1 times [2025-03-03 14:21:49,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:49,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002750636] [2025-03-03 14:21:49,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:49,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:49,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:21:49,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:21:49,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:49,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:49,318 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:21:49,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:49,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002750636] [2025-03-03 14:21:49,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002750636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:49,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:49,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:21:49,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753753502] [2025-03-03 14:21:49,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:49,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:21:49,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:49,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:21:49,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:21:49,319 INFO L87 Difference]: Start difference. First operand 415 states and 627 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:49,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:49,353 INFO L93 Difference]: Finished difference Result 807 states and 1222 transitions. [2025-03-03 14:21:49,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:21:49,354 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 110 [2025-03-03 14:21:49,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:49,356 INFO L225 Difference]: With dead ends: 807 [2025-03-03 14:21:49,357 INFO L226 Difference]: Without dead ends: 415 [2025-03-03 14:21:49,358 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-03-03 14:21:49,358 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 2 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2093 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-03-03 14:21:49,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2093 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:49,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-03 14:21:49,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2025-03-03 14:21:49,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 319 states have (on average 1.5078369905956113) internal successors, (481), 324 states have internal predecessors, (481), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (75), 69 states have call predecessors, (75), 69 states have call successors, (75) [2025-03-03 14:21:49,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 626 transitions. [2025-03-03 14:21:49,371 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 626 transitions. Word has length 110 [2025-03-03 14:21:49,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:49,375 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 626 transitions. [2025-03-03 14:21:49,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:49,375 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 626 transitions. [2025-03-03 14:21:49,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:21:49,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:49,376 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-03-03 14:21:49,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:21:49,377 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:49,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:49,377 INFO L85 PathProgramCache]: Analyzing trace with hash 101130641, now seen corresponding path program 2 times [2025-03-03 14:21:49,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:49,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119322149] [2025-03-03 14:21:49,377 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:21:49,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:49,394 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes. [2025-03-03 14:21:49,424 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:21:49,424 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:21:49,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:49,495 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:21:49,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:49,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119322149] [2025-03-03 14:21:49,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119322149] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:49,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:49,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:21:49,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446130474] [2025-03-03 14:21:49,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:49,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:21:49,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:49,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:21:49,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:21:49,496 INFO L87 Difference]: Start difference. First operand 415 states and 626 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:49,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:49,535 INFO L93 Difference]: Finished difference Result 805 states and 1217 transitions. [2025-03-03 14:21:49,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:21:49,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2025-03-03 14:21:49,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:49,538 INFO L225 Difference]: With dead ends: 805 [2025-03-03 14:21:49,538 INFO L226 Difference]: Without dead ends: 415 [2025-03-03 14:21:49,539 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-03-03 14:21:49,539 INFO L435 NwaCegarLoop]: 524 mSDtfsCounter, 2 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2079 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:49,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2079 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:49,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-03 14:21:49,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2025-03-03 14:21:49,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 319 states have (on average 1.5078369905956113) internal successors, (481), 324 states have internal predecessors, (481), 70 states have call successors, (70), 23 states have call predecessors, (70), 25 states have return successors, (74), 69 states have call predecessors, (74), 69 states have call successors, (74) [2025-03-03 14:21:49,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 625 transitions. [2025-03-03 14:21:49,551 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 625 transitions. Word has length 111 [2025-03-03 14:21:49,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:49,551 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 625 transitions. [2025-03-03 14:21:49,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:49,552 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 625 transitions. [2025-03-03 14:21:49,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:21:49,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:49,553 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:49,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:21:49,553 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:49,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:49,553 INFO L85 PathProgramCache]: Analyzing trace with hash 930436245, now seen corresponding path program 3 times [2025-03-03 14:21:49,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:49,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044746998] [2025-03-03 14:21:49,553 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:21:49,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:49,567 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 112 statements into 3 equivalence classes. [2025-03-03 14:21:49,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 100 of 112 statements. [2025-03-03 14:21:49,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 14:21:49,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:49,636 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:21:49,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:49,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044746998] [2025-03-03 14:21:49,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044746998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:49,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:49,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:21:49,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944428751] [2025-03-03 14:21:49,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:49,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:21:49,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:49,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:21:49,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:21:49,637 INFO L87 Difference]: Start difference. First operand 415 states and 625 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:49,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:49,699 INFO L93 Difference]: Finished difference Result 807 states and 1223 transitions. [2025-03-03 14:21:49,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:21:49,700 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2025-03-03 14:21:49,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:49,702 INFO L225 Difference]: With dead ends: 807 [2025-03-03 14:21:49,702 INFO L226 Difference]: Without dead ends: 417 [2025-03-03 14:21:49,703 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-03-03 14:21:49,703 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 1 mSDsluCounter, 1563 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2090 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-03-03 14:21:49,703 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2090 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:49,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2025-03-03 14:21:49,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 417. [2025-03-03 14:21:49,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 320 states have (on average 1.50625) internal successors, (482), 326 states have internal predecessors, (482), 70 states have call successors, (70), 23 states have call predecessors, (70), 26 states have return successors, (79), 69 states have call predecessors, (79), 69 states have call successors, (79) [2025-03-03 14:21:49,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 631 transitions. [2025-03-03 14:21:49,719 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 631 transitions. Word has length 112 [2025-03-03 14:21:49,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:49,719 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 631 transitions. [2025-03-03 14:21:49,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:49,720 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 631 transitions. [2025-03-03 14:21:49,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:21:49,721 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:49,721 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-03 14:21:49,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:21:49,721 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:49,721 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:49,721 INFO L85 PathProgramCache]: Analyzing trace with hash -1504281554, now seen corresponding path program 1 times [2025-03-03 14:21:49,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:49,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094092689] [2025-03-03 14:21:49,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:49,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:49,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:21:49,742 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:21:49,742 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:49,742 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:49,827 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:21:49,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:49,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094092689] [2025-03-03 14:21:49,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2094092689] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:49,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:49,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:21:49,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584514524] [2025-03-03 14:21:49,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:49,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:21:49,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:49,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:21:49,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:21:49,829 INFO L87 Difference]: Start difference. First operand 417 states and 631 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:49,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:49,868 INFO L93 Difference]: Finished difference Result 813 states and 1233 transitions. [2025-03-03 14:21:49,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:21:49,868 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2025-03-03 14:21:49,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:49,871 INFO L225 Difference]: With dead ends: 813 [2025-03-03 14:21:49,871 INFO L226 Difference]: Without dead ends: 419 [2025-03-03 14:21:49,872 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-03-03 14:21:49,875 INFO L435 NwaCegarLoop]: 527 mSDtfsCounter, 1 mSDsluCounter, 1569 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2096 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-03-03 14:21:49,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2096 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2025-03-03 14:21:49,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 419. [2025-03-03 14:21:49,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 419 states, 321 states have (on average 1.5046728971962617) internal successors, (483), 328 states have internal predecessors, (483), 70 states have call successors, (70), 23 states have call predecessors, (70), 27 states have return successors, (81), 69 states have call predecessors, (81), 69 states have call successors, (81) [2025-03-03 14:21:49,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 634 transitions. [2025-03-03 14:21:49,892 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 634 transitions. Word has length 113 [2025-03-03 14:21:49,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:49,892 INFO L471 AbstractCegarLoop]: Abstraction has 419 states and 634 transitions. [2025-03-03 14:21:49,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:21:49,892 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 634 transitions. [2025-03-03 14:21:49,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:21:49,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:49,894 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:49,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:21:49,894 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:49,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:49,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1367463393, now seen corresponding path program 1 times [2025-03-03 14:21:49,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:49,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921201269] [2025-03-03 14:21:49,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:49,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:49,907 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:21:49,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:21:49,914 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:49,914 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:49,992 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:49,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:49,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921201269] [2025-03-03 14:21:49,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921201269] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:21:49,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215627939] [2025-03-03 14:21:49,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:49,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:49,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:21:49,994 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:21:49,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:21:50,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:21:50,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:21:50,217 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:50,217 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:50,220 INFO L256 TraceCheckSpWp]: Trace formula consists of 1040 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:21:50,223 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:21:50,245 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:50,245 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:21:50,312 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:50,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215627939] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:21:50,312 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:21:50,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 14:21:50,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401510157] [2025-03-03 14:21:50,312 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:21:50,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:21:50,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:50,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:21:50,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:21:50,314 INFO L87 Difference]: Start difference. First operand 419 states and 634 transitions. Second operand has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:21:50,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:50,422 INFO L93 Difference]: Finished difference Result 975 states and 1527 transitions. [2025-03-03 14:21:50,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:21:50,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 114 [2025-03-03 14:21:50,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:50,427 INFO L225 Difference]: With dead ends: 975 [2025-03-03 14:21:50,427 INFO L226 Difference]: Without dead ends: 766 [2025-03-03 14:21:50,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:21:50,428 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 607 mSDsluCounter, 1284 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1844 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:50,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1844 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:21:50,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 766 states. [2025-03-03 14:21:50,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 766 to 742. [2025-03-03 14:21:50,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 742 states, 580 states have (on average 1.5793103448275863) internal successors, (916), 587 states have internal predecessors, (916), 134 states have call successors, (134), 23 states have call predecessors, (134), 27 states have return successors, (155), 133 states have call predecessors, (155), 133 states have call successors, (155) [2025-03-03 14:21:50,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 742 states to 742 states and 1205 transitions. [2025-03-03 14:21:50,453 INFO L78 Accepts]: Start accepts. Automaton has 742 states and 1205 transitions. Word has length 114 [2025-03-03 14:21:50,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:50,454 INFO L471 AbstractCegarLoop]: Abstraction has 742 states and 1205 transitions. [2025-03-03 14:21:50,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.857142857142858) internal successors, (104), 7 states have internal predecessors, (104), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-03-03 14:21:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states and 1205 transitions. [2025-03-03 14:21:50,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:21:50,457 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:50,457 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-03-03 14:21:50,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:21:50,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:21:50,658 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:50,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:50,659 INFO L85 PathProgramCache]: Analyzing trace with hash 854216449, now seen corresponding path program 1 times [2025-03-03 14:21:50,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:50,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941515559] [2025-03-03 14:21:50,659 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:50,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:50,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:21:50,680 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:21:50,681 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:50,681 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:50,712 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:50,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:50,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941515559] [2025-03-03 14:21:50,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941515559] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:50,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:50,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:50,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633695165] [2025-03-03 14:21:50,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:50,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:50,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:50,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:50,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:50,714 INFO L87 Difference]: Start difference. First operand 742 states and 1205 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:50,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:50,745 INFO L93 Difference]: Finished difference Result 1746 states and 2879 transitions. [2025-03-03 14:21:50,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:50,746 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 120 [2025-03-03 14:21:50,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:50,752 INFO L225 Difference]: With dead ends: 1746 [2025-03-03 14:21:50,752 INFO L226 Difference]: Without dead ends: 1070 [2025-03-03 14:21:50,755 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-03-03 14:21:50,755 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 105 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 1072 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-03-03 14:21:50,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 1072 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:50,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1070 states. [2025-03-03 14:21:50,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1070 to 1062. [2025-03-03 14:21:50,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1062 states, 836 states have (on average 1.5980861244019138) internal successors, (1336), 843 states have internal predecessors, (1336), 198 states have call successors, (198), 23 states have call predecessors, (198), 27 states have return successors, (229), 197 states have call predecessors, (229), 197 states have call successors, (229) [2025-03-03 14:21:50,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1062 states to 1062 states and 1763 transitions. [2025-03-03 14:21:50,799 INFO L78 Accepts]: Start accepts. Automaton has 1062 states and 1763 transitions. Word has length 120 [2025-03-03 14:21:50,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:50,800 INFO L471 AbstractCegarLoop]: Abstraction has 1062 states and 1763 transitions. [2025-03-03 14:21:50,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:50,800 INFO L276 IsEmpty]: Start isEmpty. Operand 1062 states and 1763 transitions. [2025-03-03 14:21:50,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:21:50,805 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:50,806 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:50,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:21:50,806 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:50,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:50,806 INFO L85 PathProgramCache]: Analyzing trace with hash -434131366, now seen corresponding path program 1 times [2025-03-03 14:21:50,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:50,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326801588] [2025-03-03 14:21:50,807 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:50,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:50,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:21:50,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:21:50,843 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:50,843 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:50,872 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:50,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:50,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1326801588] [2025-03-03 14:21:50,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1326801588] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:50,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:50,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:50,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364020186] [2025-03-03 14:21:50,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:50,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:50,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:50,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:50,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:50,874 INFO L87 Difference]: Start difference. First operand 1062 states and 1763 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:50,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:50,915 INFO L93 Difference]: Finished difference Result 2515 states and 4201 transitions. [2025-03-03 14:21:50,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:50,915 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 121 [2025-03-03 14:21:50,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:50,923 INFO L225 Difference]: With dead ends: 2515 [2025-03-03 14:21:50,924 INFO L226 Difference]: Without dead ends: 1570 [2025-03-03 14:21:50,927 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-03-03 14:21:50,928 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 103 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1068 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-03-03 14:21:50,928 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1068 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:50,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2025-03-03 14:21:50,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1562. [2025-03-03 14:21:50,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 1241 states have (on average 1.6107977437550363) internal successors, (1999), 1248 states have internal predecessors, (1999), 293 states have call successors, (293), 23 states have call predecessors, (293), 27 states have return successors, (324), 292 states have call predecessors, (324), 292 states have call successors, (324) [2025-03-03 14:21:50,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 2616 transitions. [2025-03-03 14:21:50,989 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 2616 transitions. Word has length 121 [2025-03-03 14:21:50,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:50,990 INFO L471 AbstractCegarLoop]: Abstraction has 1562 states and 2616 transitions. [2025-03-03 14:21:50,990 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:50,990 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 2616 transitions. [2025-03-03 14:21:50,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 14:21:50,997 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:50,997 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-03-03 14:21:50,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:21:50,997 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:50,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:50,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1995443586, now seen corresponding path program 1 times [2025-03-03 14:21:50,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:50,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741567715] [2025-03-03 14:21:50,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:50,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:51,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:21:51,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:21:51,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:51,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:51,051 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:51,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:51,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741567715] [2025-03-03 14:21:51,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741567715] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:51,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:51,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:51,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1766469789] [2025-03-03 14:21:51,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:51,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:51,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:51,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:51,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:51,053 INFO L87 Difference]: Start difference. First operand 1562 states and 2616 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:51,112 INFO L93 Difference]: Finished difference Result 3649 states and 6158 transitions. [2025-03-03 14:21:51,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:51,112 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2025-03-03 14:21:51,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:51,124 INFO L225 Difference]: With dead ends: 3649 [2025-03-03 14:21:51,124 INFO L226 Difference]: Without dead ends: 2326 [2025-03-03 14:21:51,129 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-03-03 14:21:51,129 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 101 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:51,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 1055 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:51,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2326 states. [2025-03-03 14:21:51,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2326 to 2318. [2025-03-03 14:21:51,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2318 states, 1874 states have (on average 1.6205976520811098) internal successors, (3037), 1881 states have internal predecessors, (3037), 416 states have call successors, (416), 23 states have call predecessors, (416), 27 states have return successors, (463), 415 states have call predecessors, (463), 415 states have call successors, (463) [2025-03-03 14:21:51,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2318 states to 2318 states and 3916 transitions. [2025-03-03 14:21:51,242 INFO L78 Accepts]: Start accepts. Automaton has 2318 states and 3916 transitions. Word has length 122 [2025-03-03 14:21:51,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:51,242 INFO L471 AbstractCegarLoop]: Abstraction has 2318 states and 3916 transitions. [2025-03-03 14:21:51,242 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:51,242 INFO L276 IsEmpty]: Start isEmpty. Operand 2318 states and 3916 transitions. [2025-03-03 14:21:51,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:21:51,252 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:51,252 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-03 14:21:51,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:21:51,252 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:51,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:51,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1505349063, now seen corresponding path program 1 times [2025-03-03 14:21:51,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:51,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491251988] [2025-03-03 14:21:51,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:51,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:51,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:21:51,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:21:51,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:51,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:51,301 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:51,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:51,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491251988] [2025-03-03 14:21:51,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491251988] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:51,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:51,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:51,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713498895] [2025-03-03 14:21:51,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:51,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:51,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:51,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:51,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:51,303 INFO L87 Difference]: Start difference. First operand 2318 states and 3916 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:51,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:51,387 INFO L93 Difference]: Finished difference Result 5412 states and 9204 transitions. [2025-03-03 14:21:51,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:51,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2025-03-03 14:21:51,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:51,406 INFO L225 Difference]: With dead ends: 5412 [2025-03-03 14:21:51,407 INFO L226 Difference]: Without dead ends: 3533 [2025-03-03 14:21:51,455 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-03-03 14:21:51,456 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 99 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:51,456 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 1055 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:51,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3533 states. [2025-03-03 14:21:51,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3533 to 3525. [2025-03-03 14:21:51,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3525 states, 2902 states have (on average 1.6271536871123362) internal successors, (4722), 2909 states have internal predecessors, (4722), 595 states have call successors, (595), 23 states have call predecessors, (595), 27 states have return successors, (668), 594 states have call predecessors, (668), 594 states have call successors, (668) [2025-03-03 14:21:51,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3525 states to 3525 states and 5985 transitions. [2025-03-03 14:21:51,595 INFO L78 Accepts]: Start accepts. Automaton has 3525 states and 5985 transitions. Word has length 123 [2025-03-03 14:21:51,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:51,595 INFO L471 AbstractCegarLoop]: Abstraction has 3525 states and 5985 transitions. [2025-03-03 14:21:51,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:51,595 INFO L276 IsEmpty]: Start isEmpty. Operand 3525 states and 5985 transitions. [2025-03-03 14:21:51,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 14:21:51,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:51,607 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-03-03 14:21:51,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:21:51,607 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:51,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:51,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1333035293, now seen corresponding path program 1 times [2025-03-03 14:21:51,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:51,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281371688] [2025-03-03 14:21:51,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:51,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:51,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:21:51,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:21:51,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:51,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:51,659 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:51,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:51,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281371688] [2025-03-03 14:21:51,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281371688] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:51,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:51,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:51,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064009659] [2025-03-03 14:21:51,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:51,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:51,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:51,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:51,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:51,660 INFO L87 Difference]: Start difference. First operand 3525 states and 5985 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:51,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:51,843 INFO L93 Difference]: Finished difference Result 8304 states and 14195 transitions. [2025-03-03 14:21:51,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:51,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2025-03-03 14:21:51,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:51,873 INFO L225 Difference]: With dead ends: 8304 [2025-03-03 14:21:51,873 INFO L226 Difference]: Without dead ends: 5525 [2025-03-03 14:21:51,884 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-03-03 14:21:51,884 INFO L435 NwaCegarLoop]: 543 mSDtfsCounter, 97 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1064 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-03-03 14:21:51,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1064 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:51,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5525 states. [2025-03-03 14:21:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5525 to 5517. [2025-03-03 14:21:52,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5517 states, 4518 states have (on average 1.6235059760956174) internal successors, (7335), 4525 states have internal predecessors, (7335), 971 states have call successors, (971), 23 states have call predecessors, (971), 27 states have return successors, (1088), 970 states have call predecessors, (1088), 970 states have call successors, (1088) [2025-03-03 14:21:52,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5517 states to 5517 states and 9394 transitions. [2025-03-03 14:21:52,170 INFO L78 Accepts]: Start accepts. Automaton has 5517 states and 9394 transitions. Word has length 124 [2025-03-03 14:21:52,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:52,171 INFO L471 AbstractCegarLoop]: Abstraction has 5517 states and 9394 transitions. [2025-03-03 14:21:52,171 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:52,171 INFO L276 IsEmpty]: Start isEmpty. Operand 5517 states and 9394 transitions. [2025-03-03 14:21:52,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 14:21:52,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:52,186 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-03-03 14:21:52,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:21:52,187 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:52,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:52,187 INFO L85 PathProgramCache]: Analyzing trace with hash -97140712, now seen corresponding path program 1 times [2025-03-03 14:21:52,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:52,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624659310] [2025-03-03 14:21:52,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:52,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:52,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:21:52,208 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:21:52,208 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:52,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:52,262 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:52,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:52,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624659310] [2025-03-03 14:21:52,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [624659310] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:52,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:52,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:52,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776420619] [2025-03-03 14:21:52,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:52,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:52,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:52,264 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:52,264 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:52,264 INFO L87 Difference]: Start difference. First operand 5517 states and 9394 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:52,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:52,432 INFO L93 Difference]: Finished difference Result 13536 states and 23200 transitions. [2025-03-03 14:21:52,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:52,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2025-03-03 14:21:52,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:52,476 INFO L225 Difference]: With dead ends: 13536 [2025-03-03 14:21:52,477 INFO L226 Difference]: Without dead ends: 9136 [2025-03-03 14:21:52,494 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-03-03 14:21:52,495 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 95 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 1066 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-03-03 14:21:52,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 1066 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:52,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9136 states. [2025-03-03 14:21:52,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9136 to 9128. [2025-03-03 14:21:52,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9128 states, 7523 states have (on average 1.622889804599229) internal successors, (12209), 7530 states have internal predecessors, (12209), 1577 states have call successors, (1577), 23 states have call predecessors, (1577), 27 states have return successors, (1772), 1576 states have call predecessors, (1772), 1576 states have call successors, (1772) [2025-03-03 14:21:52,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9128 states to 9128 states and 15558 transitions. [2025-03-03 14:21:52,839 INFO L78 Accepts]: Start accepts. Automaton has 9128 states and 15558 transitions. Word has length 125 [2025-03-03 14:21:52,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:52,839 INFO L471 AbstractCegarLoop]: Abstraction has 9128 states and 15558 transitions. [2025-03-03 14:21:52,840 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:52,840 INFO L276 IsEmpty]: Start isEmpty. Operand 9128 states and 15558 transitions. [2025-03-03 14:21:52,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 14:21:52,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:52,860 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-03 14:21:52,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:21:52,860 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:52,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:52,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1728332324, now seen corresponding path program 1 times [2025-03-03 14:21:52,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:52,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013695956] [2025-03-03 14:21:52,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:52,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:52,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:21:52,880 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:21:52,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:52,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:52,908 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:52,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:52,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013695956] [2025-03-03 14:21:52,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013695956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:52,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:52,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:52,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390526082] [2025-03-03 14:21:52,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:52,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:52,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:52,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:52,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:52,910 INFO L87 Difference]: Start difference. First operand 9128 states and 15558 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:53,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:53,199 INFO L93 Difference]: Finished difference Result 23518 states and 40263 transitions. [2025-03-03 14:21:53,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:53,256 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2025-03-03 14:21:53,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:53,318 INFO L225 Difference]: With dead ends: 23518 [2025-03-03 14:21:53,318 INFO L226 Difference]: Without dead ends: 15952 [2025-03-03 14:21:53,342 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-03-03 14:21:53,343 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 93 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 1074 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-03-03 14:21:53,343 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 1074 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:53,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15952 states. [2025-03-03 14:21:53,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15952 to 15944. [2025-03-03 14:21:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15944 states, 13136 states have (on average 1.6149512789281364) internal successors, (21214), 13143 states have internal predecessors, (21214), 2780 states have call successors, (2780), 23 states have call predecessors, (2780), 27 states have return successors, (3119), 2779 states have call predecessors, (3119), 2779 states have call successors, (3119) [2025-03-03 14:21:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15944 states to 15944 states and 27113 transitions. [2025-03-03 14:21:54,055 INFO L78 Accepts]: Start accepts. Automaton has 15944 states and 27113 transitions. Word has length 126 [2025-03-03 14:21:54,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:54,056 INFO L471 AbstractCegarLoop]: Abstraction has 15944 states and 27113 transitions. [2025-03-03 14:21:54,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:54,056 INFO L276 IsEmpty]: Start isEmpty. Operand 15944 states and 27113 transitions. [2025-03-03 14:21:54,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 14:21:54,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:54,088 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-03 14:21:54,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:21:54,088 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:54,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:54,089 INFO L85 PathProgramCache]: Analyzing trace with hash -620528009, now seen corresponding path program 1 times [2025-03-03 14:21:54,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:54,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1100107741] [2025-03-03 14:21:54,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:54,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:54,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:21:54,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:21:54,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:54,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:54,142 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:54,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:54,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1100107741] [2025-03-03 14:21:54,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1100107741] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:54,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:54,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:54,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557138126] [2025-03-03 14:21:54,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:54,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:54,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:54,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:54,145 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:54,145 INFO L87 Difference]: Start difference. First operand 15944 states and 27113 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:54,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:54,718 INFO L93 Difference]: Finished difference Result 42089 states and 71927 transitions. [2025-03-03 14:21:54,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:54,718 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2025-03-03 14:21:54,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:54,807 INFO L225 Difference]: With dead ends: 42089 [2025-03-03 14:21:54,807 INFO L226 Difference]: Without dead ends: 28341 [2025-03-03 14:21:54,842 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-03-03 14:21:54,843 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 91 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:54,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1058 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:54,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28341 states. [2025-03-03 14:21:55,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28341 to 28333. [2025-03-03 14:21:55,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28333 states, 23486 states have (on average 1.6116835561611174) internal successors, (37852), 23493 states have internal predecessors, (37852), 4819 states have call successors, (4819), 23 states have call predecessors, (4819), 27 states have return successors, (5432), 4818 states have call predecessors, (5432), 4818 states have call successors, (5432) [2025-03-03 14:21:55,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28333 states to 28333 states and 48103 transitions. [2025-03-03 14:21:55,724 INFO L78 Accepts]: Start accepts. Automaton has 28333 states and 48103 transitions. Word has length 127 [2025-03-03 14:21:55,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:55,724 INFO L471 AbstractCegarLoop]: Abstraction has 28333 states and 48103 transitions. [2025-03-03 14:21:55,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:55,724 INFO L276 IsEmpty]: Start isEmpty. Operand 28333 states and 48103 transitions. [2025-03-03 14:21:55,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 14:21:55,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:55,756 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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-03-03 14:21:55,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:21:55,756 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:55,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:55,756 INFO L85 PathProgramCache]: Analyzing trace with hash 2042190405, now seen corresponding path program 1 times [2025-03-03 14:21:55,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:55,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977412209] [2025-03-03 14:21:55,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:55,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:55,771 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 14:21:55,777 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 14:21:55,778 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:55,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:55,806 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:55,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:55,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977412209] [2025-03-03 14:21:55,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977412209] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:55,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:55,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:55,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546063526] [2025-03-03 14:21:55,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:55,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:55,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:55,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:55,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:55,808 INFO L87 Difference]: Start difference. First operand 28333 states and 48103 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:57,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:21:57,191 INFO L93 Difference]: Finished difference Result 77071 states and 131374 transitions. [2025-03-03 14:21:57,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:21:57,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2025-03-03 14:21:57,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:21:57,376 INFO L225 Difference]: With dead ends: 77071 [2025-03-03 14:21:57,376 INFO L226 Difference]: Without dead ends: 51697 [2025-03-03 14:21:57,429 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-03-03 14:21:57,429 INFO L435 NwaCegarLoop]: 532 mSDtfsCounter, 89 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:21:57,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 1058 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:21:57,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51697 states. [2025-03-03 14:21:58,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51697 to 51689. [2025-03-03 14:21:58,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51689 states, 43127 states have (on average 1.6068356250144922) internal successors, (69298), 43134 states have internal predecessors, (69298), 8534 states have call successors, (8534), 23 states have call predecessors, (8534), 27 states have return successors, (9679), 8533 states have call predecessors, (9679), 8533 states have call successors, (9679) [2025-03-03 14:21:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51689 states to 51689 states and 87511 transitions. [2025-03-03 14:21:59,016 INFO L78 Accepts]: Start accepts. Automaton has 51689 states and 87511 transitions. Word has length 128 [2025-03-03 14:21:59,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:21:59,017 INFO L471 AbstractCegarLoop]: Abstraction has 51689 states and 87511 transitions. [2025-03-03 14:21:59,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:21:59,018 INFO L276 IsEmpty]: Start isEmpty. Operand 51689 states and 87511 transitions. [2025-03-03 14:21:59,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 14:21:59,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:21:59,050 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:21:59,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:21:59,051 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:21:59,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:21:59,052 INFO L85 PathProgramCache]: Analyzing trace with hash -1668088778, now seen corresponding path program 1 times [2025-03-03 14:21:59,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:21:59,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333475572] [2025-03-03 14:21:59,052 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:21:59,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:21:59,068 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:21:59,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:21:59,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:21:59,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:21:59,105 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:21:59,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:21:59,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333475572] [2025-03-03 14:21:59,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333475572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:21:59,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:21:59,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:21:59,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821958777] [2025-03-03 14:21:59,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:21:59,107 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:21:59,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:21:59,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:21:59,108 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:21:59,108 INFO L87 Difference]: Start difference. First operand 51689 states and 87511 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:22:01,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:01,333 INFO L93 Difference]: Finished difference Result 96332 states and 163482 transitions. [2025-03-03 14:22:01,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:01,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2025-03-03 14:22:01,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:01,808 INFO L225 Difference]: With dead ends: 96332 [2025-03-03 14:22:01,808 INFO L226 Difference]: Without dead ends: 96123 [2025-03-03 14:22:01,876 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-03-03 14:22:01,877 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 84 mSDsluCounter, 531 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 1072 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:01,877 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 1072 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:01,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96123 states. [2025-03-03 14:22:04,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96123 to 96115. [2025-03-03 14:22:04,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96115 states, 80754 states have (on average 1.6003541620229338) internal successors, (129235), 80761 states have internal predecessors, (129235), 15333 states have call successors, (15333), 23 states have call predecessors, (15333), 27 states have return successors, (17524), 15332 states have call predecessors, (17524), 15332 states have call successors, (17524) [2025-03-03 14:22:04,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96115 states to 96115 states and 162092 transitions. [2025-03-03 14:22:04,874 INFO L78 Accepts]: Start accepts. Automaton has 96115 states and 162092 transitions. Word has length 129 [2025-03-03 14:22:04,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:04,874 INFO L471 AbstractCegarLoop]: Abstraction has 96115 states and 162092 transitions. [2025-03-03 14:22:04,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:22:04,874 INFO L276 IsEmpty]: Start isEmpty. Operand 96115 states and 162092 transitions. [2025-03-03 14:22:04,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 14:22:04,910 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:04,910 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:04,910 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:22:04,910 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:04,910 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:04,910 INFO L85 PathProgramCache]: Analyzing trace with hash -650046810, now seen corresponding path program 1 times [2025-03-03 14:22:04,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:04,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333634600] [2025-03-03 14:22:04,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:04,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:04,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:22:04,932 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:22:04,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:04,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:05,159 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:05,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:05,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333634600] [2025-03-03 14:22:05,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333634600] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:05,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:05,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-03-03 14:22:05,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071019146] [2025-03-03 14:22:05,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:05,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 14:22:05,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:05,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 14:22:05,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:22:05,162 INFO L87 Difference]: Start difference. First operand 96115 states and 162092 transitions. Second operand has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-03 14:22:10,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:10,136 INFO L93 Difference]: Finished difference Result 191836 states and 328936 transitions. [2025-03-03 14:22:10,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 14:22:10,137 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) Word has length 130 [2025-03-03 14:22:10,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:11,049 INFO L225 Difference]: With dead ends: 191836 [2025-03-03 14:22:11,050 INFO L226 Difference]: Without dead ends: 191633 [2025-03-03 14:22:11,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2025-03-03 14:22:11,120 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 1627 mSDsluCounter, 6836 mSDsCounter, 0 mSdLazyCounter, 1522 mSolverCounterSat, 528 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1627 SdHoareTripleChecker+Valid, 7486 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 528 IncrementalHoareTripleChecker+Valid, 1522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:11,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1627 Valid, 7486 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [528 Valid, 1522 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 14:22:11,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191633 states. [2025-03-03 14:22:16,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191633 to 191465. [2025-03-03 14:22:17,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191465 states, 160926 states have (on average 1.601127226178492) internal successors, (257663), 160830 states have internal predecessors, (257663), 30469 states have call successors, (30469), 62 states have call predecessors, (30469), 69 states have return successors, (38125), 30578 states have call predecessors, (38125), 30466 states have call successors, (38125) [2025-03-03 14:22:18,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191465 states to 191465 states and 326257 transitions. [2025-03-03 14:22:18,174 INFO L78 Accepts]: Start accepts. Automaton has 191465 states and 326257 transitions. Word has length 130 [2025-03-03 14:22:18,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:18,175 INFO L471 AbstractCegarLoop]: Abstraction has 191465 states and 326257 transitions. [2025-03-03 14:22:18,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (15), 3 states have call predecessors, (15), 4 states have return successors, (13), 6 states have call predecessors, (13), 6 states have call successors, (13) [2025-03-03 14:22:18,176 INFO L276 IsEmpty]: Start isEmpty. Operand 191465 states and 326257 transitions. [2025-03-03 14:22:18,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 14:22:18,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:18,271 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:18,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:22:18,271 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:18,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:18,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1140619633, now seen corresponding path program 1 times [2025-03-03 14:22:18,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:18,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122668888] [2025-03-03 14:22:18,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:18,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:18,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:22:18,292 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:22:18,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:18,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:18,350 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:18,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:18,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122668888] [2025-03-03 14:22:18,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122668888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:18,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:18,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:18,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853505206] [2025-03-03 14:22:18,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:18,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:18,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:18,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:18,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:18,352 INFO L87 Difference]: Start difference. First operand 191465 states and 326257 transitions. Second operand has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13)