./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec11_product18.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec11_product18.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 58fd69d2f74506159a7a57598b08a18ff098ebf1233f7e6688a335d4e30dd566 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:40:39,951 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:40:40,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 15:40:40,013 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:40:40,013 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:40:40,027 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:40:40,028 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:40:40,028 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:40:40,028 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:40:40,028 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:40:40,028 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:40:40,028 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:40:40,029 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:40:40,029 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:40:40,029 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:40:40,029 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:40:40,029 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:40:40,029 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:40:40,029 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:40:40,029 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:40:40,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:40:40,030 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:40:40,030 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:40:40,030 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:40:40,030 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:40:40,030 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:40:40,030 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:40:40,030 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:40:40,030 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:40:40,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:40:40,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:40:40,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:40:40,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:40:40,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:40:40,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:40:40,031 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:40:40,031 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:40:40,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:40:40,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:40:40,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:40:40,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:40:40,031 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:40:40,031 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:40:40,031 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 58fd69d2f74506159a7a57598b08a18ff098ebf1233f7e6688a335d4e30dd566 [2025-02-05 15:40:40,270 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:40:40,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:40:40,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:40:40,284 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:40:40,284 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:40:40,286 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec11_product18.cil.c [2025-02-05 15:40:41,509 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/917b7cea4/d99441aa461744008592169a5df31724/FLAG89bfab70a [2025-02-05 15:40:41,837 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:40:41,837 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product18.cil.c [2025-02-05 15:40:41,852 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/917b7cea4/d99441aa461744008592169a5df31724/FLAG89bfab70a [2025-02-05 15:40:41,863 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/917b7cea4/d99441aa461744008592169a5df31724 [2025-02-05 15:40:41,864 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:40:41,865 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:40:41,866 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:40:41,866 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:40:41,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:40:41,869 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:40:41" (1/1) ... [2025-02-05 15:40:41,870 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76530039 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:41, skipping insertion in model container [2025-02-05 15:40:41,870 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:40:41" (1/1) ... [2025-02-05 15:40:41,932 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:40:42,349 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product18.cil.c[57905,57918] [2025-02-05 15:40:42,364 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:40:42,378 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:40:42,384 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2025-02-05 15:40:42,385 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [167] [2025-02-05 15:40:42,385 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [392] [2025-02-05 15:40:42,385 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [409] [2025-02-05 15:40:42,385 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [447] [2025-02-05 15:40:42,385 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [851] [2025-02-05 15:40:42,385 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1931] [2025-02-05 15:40:42,385 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2297] [2025-02-05 15:40:42,385 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2591] [2025-02-05 15:40:42,386 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptAutoResponder_spec.i","") [2600] [2025-02-05 15:40:42,386 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2619] [2025-02-05 15:40:42,449 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product18.cil.c[57905,57918] [2025-02-05 15:40:42,454 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:40:42,484 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:40:42,484 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:42 WrapperNode [2025-02-05 15:40:42,485 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:40:42,485 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:40:42,485 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:40:42,485 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:40:42,491 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:42" (1/1) ... [2025-02-05 15:40:42,517 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:42" (1/1) ... [2025-02-05 15:40:42,546 INFO L138 Inliner]: procedures = 127, calls = 184, calls flagged for inlining = 59, calls inlined = 50, statements flattened = 908 [2025-02-05 15:40:42,546 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:40:42,547 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:40:42,547 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:40:42,547 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:40:42,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:42" (1/1) ... [2025-02-05 15:40:42,554 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:42" (1/1) ... [2025-02-05 15:40:42,556 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:42" (1/1) ... [2025-02-05 15:40:42,584 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-02-05 15:40:42,584 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:42" (1/1) ... [2025-02-05 15:40:42,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:42" (1/1) ... [2025-02-05 15:40:42,597 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:42" (1/1) ... [2025-02-05 15:40:42,598 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:42" (1/1) ... [2025-02-05 15:40:42,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:42" (1/1) ... [2025-02-05 15:40:42,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:42" (1/1) ... [2025-02-05 15:40:42,605 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:40:42,606 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:40:42,606 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:40:42,606 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:40:42,607 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:42" (1/1) ... [2025-02-05 15:40:42,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:40:42,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:42,639 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 15:40:42,648 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 15:40:42,670 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:40:42,670 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:40:42,670 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:40:42,670 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:40:42,670 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:40:42,670 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:40:42,671 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-02-05 15:40:42,671 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-02-05 15:40:42,671 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-02-05 15:40:42,671 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-02-05 15:40:42,671 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-02-05 15:40:42,671 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-02-05 15:40:42,671 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:40:42,671 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:40:42,671 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:40:42,672 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:40:42,672 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:40:42,672 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-02-05 15:40:42,672 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-02-05 15:40:42,672 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-02-05 15:40:42,672 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-02-05 15:40:42,672 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-02-05 15:40:42,672 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-02-05 15:40:42,672 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:40:42,672 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:40:42,672 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:40:42,673 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:40:42,673 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-02-05 15:40:42,673 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-02-05 15:40:42,673 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:40:42,673 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:40:42,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:40:42,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:40:42,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 15:40:42,673 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-05 15:40:42,673 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-02-05 15:40:42,673 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-02-05 15:40:42,673 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:40:42,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:40:42,857 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:40:42,858 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:40:42,903 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L795: #res := ~retValue_acc~15; [2025-02-05 15:40:43,091 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2488-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~41#1; [2025-02-05 15:40:43,091 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1473-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~26#1; [2025-02-05 15:40:43,091 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1789-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~31#1; [2025-02-05 15:40:43,091 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1426-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~25#1; [2025-02-05 15:40:43,091 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1908-1: getClientId_#res#1 := getClientId_~retValue_acc~33#1; [2025-02-05 15:40:43,102 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L758: #res := ~retValue_acc~14; [2025-02-05 15:40:43,158 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L569: #res := ~retValue_acc~9; [2025-02-05 15:40:43,192 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1565: #res#1 := ~retValue_acc~28#1; [2025-02-05 15:40:43,192 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1520-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~27#1; [2025-02-05 15:40:43,214 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L164-1: createEmail_#res#1 := createEmail_~retValue_acc~2#1; [2025-02-05 15:40:43,422 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2463-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~40#1; [2025-02-05 15:40:43,422 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L444-1: valid_product_#res#1 := valid_product_~retValue_acc~5#1; [2025-02-05 15:40:43,422 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2445-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~38#1; [2025-02-05 15:40:43,422 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1735-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~30#1; [2025-02-05 15:40:43,422 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1628-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~29#1; [2025-02-05 15:40:43,422 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2454-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~39#1; [2025-02-05 15:40:43,428 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L532: #res := ~retValue_acc~8; [2025-02-05 15:40:43,430 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L140: #res := ~retValue_acc~0; [2025-02-05 15:40:43,522 INFO L? ?]: Removed 396 outVars from TransFormulas that were not future-live. [2025-02-05 15:40:43,522 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:40:43,543 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:40:43,544 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:40:43,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:40:43 BoogieIcfgContainer [2025-02-05 15:40:43,544 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:40:43,546 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:40:43,548 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:40:43,551 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:40:43,551 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:40:41" (1/3) ... [2025-02-05 15:40:43,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670562eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:40:43, skipping insertion in model container [2025-02-05 15:40:43,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:42" (2/3) ... [2025-02-05 15:40:43,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@670562eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:40:43, skipping insertion in model container [2025-02-05 15:40:43,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:40:43" (3/3) ... [2025-02-05 15:40:43,553 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec11_product18.cil.c [2025-02-05 15:40:43,563 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:40:43,568 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec11_product18.cil.c that has 17 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:40:43,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:40:43,628 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;@3224acac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:40:43,628 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:40:43,631 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 227 states have (on average 1.5462555066079295) internal successors, (351), 229 states have internal predecessors, (351), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-02-05 15:40:43,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 15:40:43,642 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:43,642 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-05 15:40:43,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:43,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:43,646 INFO L85 PathProgramCache]: Analyzing trace with hash 149461705, now seen corresponding path program 1 times [2025-02-05 15:40:43,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:43,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130421533] [2025-02-05 15:40:43,651 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:43,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:43,755 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 15:40:43,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 15:40:43,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:43,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:44,203 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:40:44,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:44,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130421533] [2025-02-05 15:40:44,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130421533] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:44,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1101347633] [2025-02-05 15:40:44,204 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:44,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:44,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:44,209 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:40:44,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 15:40:44,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 15:40:44,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 15:40:44,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:44,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:44,516 INFO L256 TraceCheckSpWp]: Trace formula consists of 1004 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:40:44,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:44,540 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 15:40:44,541 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:44,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1101347633] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:44,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:44,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:40:44,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193328372] [2025-02-05 15:40:44,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:44,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:40:44,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:44,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:40:44,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:44,569 INFO L87 Difference]: Start difference. First operand has 283 states, 227 states have (on average 1.5462555066079295) internal successors, (351), 229 states have internal predecessors, (351), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:40:44,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:44,611 INFO L93 Difference]: Finished difference Result 413 states and 610 transitions. [2025-02-05 15:40:44,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:40:44,613 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2025-02-05 15:40:44,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:44,624 INFO L225 Difference]: With dead ends: 413 [2025-02-05 15:40:44,626 INFO L226 Difference]: Without dead ends: 276 [2025-02-05 15:40:44,631 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:44,635 INFO L435 NwaCegarLoop]: 424 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, 424 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:44,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:44,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2025-02-05 15:40:44,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 276. [2025-02-05 15:40:44,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 276 states, 221 states have (on average 1.5429864253393666) internal successors, (341), 222 states have internal predecessors, (341), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-05 15:40:44,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 416 transitions. [2025-02-05 15:40:44,687 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 416 transitions. Word has length 98 [2025-02-05 15:40:44,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:44,689 INFO L471 AbstractCegarLoop]: Abstraction has 276 states and 416 transitions. [2025-02-05 15:40:44,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:40:44,689 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 416 transitions. [2025-02-05 15:40:44,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 15:40:44,696 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:44,696 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-05 15:40:44,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 15:40:44,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-05 15:40:44,897 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:44,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:44,898 INFO L85 PathProgramCache]: Analyzing trace with hash -299197756, now seen corresponding path program 1 times [2025-02-05 15:40:44,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:44,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869718282] [2025-02-05 15:40:44,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:44,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:44,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:40:44,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:40:44,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:44,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:45,139 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-02-05 15:40:45,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:45,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869718282] [2025-02-05 15:40:45,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869718282] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:45,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [28448959] [2025-02-05 15:40:45,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:45,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:45,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:45,141 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:40:45,146 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 15:40:45,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-02-05 15:40:45,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-02-05 15:40:45,401 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:45,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:45,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 1005 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:40:45,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:45,430 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 15:40:45,430 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:45,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [28448959] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:45,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:45,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:40:45,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864115397] [2025-02-05 15:40:45,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:45,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:45,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:45,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:45,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:40:45,433 INFO L87 Difference]: Start difference. First operand 276 states and 416 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:40:45,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:45,459 INFO L93 Difference]: Finished difference Result 402 states and 591 transitions. [2025-02-05 15:40:45,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:45,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2025-02-05 15:40:45,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:45,464 INFO L225 Difference]: With dead ends: 402 [2025-02-05 15:40:45,464 INFO L226 Difference]: Without dead ends: 278 [2025-02-05 15:40:45,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:40:45,468 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 0 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 828 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:45,468 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 828 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:45,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2025-02-05 15:40:45,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2025-02-05 15:40:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 223 states have (on average 1.5381165919282511) internal successors, (343), 224 states have internal predecessors, (343), 38 states have call successors, (38), 16 states have call predecessors, (38), 16 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-02-05 15:40:45,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 418 transitions. [2025-02-05 15:40:45,494 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 418 transitions. Word has length 99 [2025-02-05 15:40:45,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:45,494 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 418 transitions. [2025-02-05 15:40:45,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:40:45,494 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 418 transitions. [2025-02-05 15:40:45,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-02-05 15:40:45,500 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:45,500 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-05 15:40:45,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-05 15:40:45,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:45,701 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:45,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:45,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1168551410, now seen corresponding path program 1 times [2025-02-05 15:40:45,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:45,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792652658] [2025-02-05 15:40:45,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:45,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:45,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:40:45,754 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:40:45,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:45,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:45,950 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 15:40:45,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:45,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792652658] [2025-02-05 15:40:45,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792652658] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:45,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997265992] [2025-02-05 15:40:45,953 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:45,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:45,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:45,958 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:40:45,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 15:40:46,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-02-05 15:40:46,201 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-02-05 15:40:46,201 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:46,201 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:46,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:40:46,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:46,230 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 15:40:46,230 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:46,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997265992] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:46,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:46,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:40:46,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495641894] [2025-02-05 15:40:46,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:46,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:46,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:46,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:46,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:40:46,235 INFO L87 Difference]: Start difference. First operand 278 states and 418 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:40:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:46,265 INFO L93 Difference]: Finished difference Result 585 states and 894 transitions. [2025-02-05 15:40:46,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:46,266 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2025-02-05 15:40:46,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:46,272 INFO L225 Difference]: With dead ends: 585 [2025-02-05 15:40:46,272 INFO L226 Difference]: Without dead ends: 334 [2025-02-05 15:40:46,272 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-02-05 15:40:46,273 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 107 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:46,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 790 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:46,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2025-02-05 15:40:46,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 326. [2025-02-05 15:40:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 260 states have (on average 1.5538461538461539) internal successors, (404), 261 states have internal predecessors, (404), 49 states have call successors, (49), 16 states have call predecessors, (49), 16 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-02-05 15:40:46,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 501 transitions. [2025-02-05 15:40:46,303 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 501 transitions. Word has length 107 [2025-02-05 15:40:46,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:46,303 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 501 transitions. [2025-02-05 15:40:46,303 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-02-05 15:40:46,303 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 501 transitions. [2025-02-05 15:40:46,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 15:40:46,307 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:46,307 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-02-05 15:40:46,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-05 15:40:46,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:46,508 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:46,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:46,509 INFO L85 PathProgramCache]: Analyzing trace with hash -454190575, now seen corresponding path program 1 times [2025-02-05 15:40:46,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:46,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549169205] [2025-02-05 15:40:46,509 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:46,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:46,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:40:46,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:40:46,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:46,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:46,722 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 15:40:46,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:46,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549169205] [2025-02-05 15:40:46,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549169205] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:46,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [546995214] [2025-02-05 15:40:46,722 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:46,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:46,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:46,725 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:40:46,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 15:40:46,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 15:40:46,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 15:40:46,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:46,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:46,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-05 15:40:46,968 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:47,011 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 15:40:47,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:47,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [546995214] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:47,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:47,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:40:47,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833695030] [2025-02-05 15:40:47,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:47,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:47,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:47,015 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:47,015 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:47,015 INFO L87 Difference]: Start difference. First operand 326 states and 501 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, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:40:47,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:47,065 INFO L93 Difference]: Finished difference Result 643 states and 992 transitions. [2025-02-05 15:40:47,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:47,071 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, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-02-05 15:40:47,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:47,074 INFO L225 Difference]: With dead ends: 643 [2025-02-05 15:40:47,074 INFO L226 Difference]: Without dead ends: 328 [2025-02-05 15:40:47,075 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-02-05 15:40:47,076 INFO L435 NwaCegarLoop]: 408 mSDtfsCounter, 2 mSDsluCounter, 1213 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1621 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:47,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1621 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:47,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-02-05 15:40:47,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-02-05 15:40:47,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 261 states have (on average 1.5517241379310345) internal successors, (405), 263 states have internal predecessors, (405), 49 states have call successors, (49), 16 states have call predecessors, (49), 17 states have return successors, (50), 48 states have call predecessors, (50), 48 states have call successors, (50) [2025-02-05 15:40:47,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 504 transitions. [2025-02-05 15:40:47,086 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 504 transitions. Word has length 108 [2025-02-05 15:40:47,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:47,086 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 504 transitions. [2025-02-05 15:40:47,086 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, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:40:47,087 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 504 transitions. [2025-02-05 15:40:47,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-02-05 15:40:47,088 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:47,088 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-02-05 15:40:47,095 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 15:40:47,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:47,289 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:47,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:47,290 INFO L85 PathProgramCache]: Analyzing trace with hash 1993252932, now seen corresponding path program 1 times [2025-02-05 15:40:47,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:47,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905668537] [2025-02-05 15:40:47,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:47,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:47,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:40:47,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:40:47,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:47,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:47,434 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-02-05 15:40:47,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:47,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905668537] [2025-02-05 15:40:47,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905668537] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:47,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945680772] [2025-02-05 15:40:47,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:47,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:47,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:47,436 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 15:40:47,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 15:40:47,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-02-05 15:40:47,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-02-05 15:40:47,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:47,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:47,649 INFO L256 TraceCheckSpWp]: Trace formula consists of 1036 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:40:47,652 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:47,692 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-02-05 15:40:47,693 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:47,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945680772] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:47,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:47,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-02-05 15:40:47,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765540653] [2025-02-05 15:40:47,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:47,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:47,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:47,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:47,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-02-05 15:40:47,694 INFO L87 Difference]: Start difference. First operand 328 states and 504 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, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:40:47,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:47,748 INFO L93 Difference]: Finished difference Result 645 states and 997 transitions. [2025-02-05 15:40:47,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:47,751 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, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2025-02-05 15:40:47,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:47,752 INFO L225 Difference]: With dead ends: 645 [2025-02-05 15:40:47,753 INFO L226 Difference]: Without dead ends: 330 [2025-02-05 15:40:47,753 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-02-05 15:40:47,754 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 2 mSDsluCounter, 1201 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:47,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1607 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:47,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-02-05 15:40:47,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-02-05 15:40:47,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 262 states have (on average 1.549618320610687) internal successors, (406), 265 states have internal predecessors, (406), 49 states have call successors, (49), 16 states have call predecessors, (49), 18 states have return successors, (55), 48 states have call predecessors, (55), 48 states have call successors, (55) [2025-02-05 15:40:47,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 510 transitions. [2025-02-05 15:40:47,764 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 510 transitions. Word has length 109 [2025-02-05 15:40:47,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:47,764 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 510 transitions. [2025-02-05 15:40:47,764 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, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:40:47,764 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 510 transitions. [2025-02-05 15:40:47,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-02-05 15:40:47,766 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:47,766 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] [2025-02-05 15:40:47,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-02-05 15:40:47,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:47,967 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:47,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:47,967 INFO L85 PathProgramCache]: Analyzing trace with hash -722154993, now seen corresponding path program 1 times [2025-02-05 15:40:47,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:47,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451811726] [2025-02-05 15:40:47,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:47,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:47,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-02-05 15:40:47,988 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-02-05 15:40:47,988 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:47,988 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-02-05 15:40:48,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:48,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451811726] [2025-02-05 15:40:48,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451811726] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:48,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:48,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:40:48,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1912017827] [2025-02-05 15:40:48,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:48,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:48,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:48,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:48,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:48,089 INFO L87 Difference]: Start difference. First operand 330 states and 510 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:40:48,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:48,131 INFO L93 Difference]: Finished difference Result 637 states and 988 transitions. [2025-02-05 15:40:48,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:48,132 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2025-02-05 15:40:48,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:48,135 INFO L225 Difference]: With dead ends: 637 [2025-02-05 15:40:48,136 INFO L226 Difference]: Without dead ends: 330 [2025-02-05 15:40:48,137 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:48,138 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 2 mSDsluCounter, 1216 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:48,138 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1625 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:48,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-02-05 15:40:48,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-02-05 15:40:48,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 262 states have (on average 1.549618320610687) internal successors, (406), 265 states have internal predecessors, (406), 49 states have call successors, (49), 16 states have call predecessors, (49), 18 states have return successors, (54), 48 states have call predecessors, (54), 48 states have call successors, (54) [2025-02-05 15:40:48,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 509 transitions. [2025-02-05 15:40:48,162 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 509 transitions. Word has length 110 [2025-02-05 15:40:48,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:48,162 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 509 transitions. [2025-02-05 15:40:48,162 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-02-05 15:40:48,162 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 509 transitions. [2025-02-05 15:40:48,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-02-05 15:40:48,164 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:48,164 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:48,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:40:48,164 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:48,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:48,164 INFO L85 PathProgramCache]: Analyzing trace with hash -1702538336, now seen corresponding path program 2 times [2025-02-05 15:40:48,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:48,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908014223] [2025-02-05 15:40:48,165 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:40:48,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:48,190 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes. [2025-02-05 15:40:48,194 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 44 of 111 statements. [2025-02-05 15:40:48,194 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:40:48,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:48,234 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-02-05 15:40:48,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:48,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908014223] [2025-02-05 15:40:48,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908014223] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:48,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:48,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:40:48,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099034328] [2025-02-05 15:40:48,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:48,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:48,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:48,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:48,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:48,236 INFO L87 Difference]: Start difference. First operand 330 states and 509 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-05 15:40:48,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:48,257 INFO L93 Difference]: Finished difference Result 330 states and 509 transitions. [2025-02-05 15:40:48,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:48,257 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2025-02-05 15:40:48,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:48,258 INFO L225 Difference]: With dead ends: 330 [2025-02-05 15:40:48,258 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 15:40:48,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:48,259 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 0 mSDsluCounter, 1229 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1641 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:48,259 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1641 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:48,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 15:40:48,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 15:40:48,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 15:40:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 15:40:48,260 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 111 [2025-02-05 15:40:48,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:48,260 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 15:40:48,260 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 1 states have call successors, (14), 1 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 1 states have call successors, (12) [2025-02-05 15:40:48,260 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 15:40:48,260 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 15:40:48,262 INFO L782 garLoopResultBuilder]: Registering result SAFE for location outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:40:48,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 15:40:48,264 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1] [2025-02-05 15:40:48,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 15:40:48,337 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:40:48,350 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:40:48 BoogieIcfgContainer [2025-02-05 15:40:48,350 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:40:48,351 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:40:48,351 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:40:48,351 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:40:48,352 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:40:43" (3/4) ... [2025-02-05 15:40:48,353 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 15:40:48,358 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure getEmailSignKey [2025-02-05 15:40:48,358 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure outgoing [2025-02-05 15:40:48,358 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isSigned [2025-02-05 15:40:48,358 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setClientPrivateKey [2025-02-05 15:40:48,358 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure chuckKeyAdd [2025-02-05 15:40:48,358 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setEmailTo [2025-02-05 15:40:48,358 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure getEmailTo [2025-02-05 15:40:48,358 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure createClientKeyringEntry [2025-02-05 15:40:48,358 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure generateKeyPair [2025-02-05 15:40:48,358 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setClientKeyringUser [2025-02-05 15:40:48,358 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure sendEmail [2025-02-05 15:40:48,358 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setEmailFrom [2025-02-05 15:40:48,359 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure getEmailFrom [2025-02-05 15:40:48,359 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isReadable [2025-02-05 15:40:48,359 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setClientKeyringPublicKey [2025-02-05 15:40:48,359 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setClientId [2025-02-05 15:40:48,377 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 79 nodes and edges [2025-02-05 15:40:48,378 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 44 nodes and edges [2025-02-05 15:40:48,381 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 8 nodes and edges [2025-02-05 15:40:48,382 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 15:40:48,383 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 15:40:48,384 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 15:40:48,495 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:40:48,496 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:40:48,496 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:40:48,496 INFO L158 Benchmark]: Toolchain (without parser) took 6630.92ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 109.9MB in the beginning and 178.9MB in the end (delta: -69.0MB). Peak memory consumption was 111.9MB. Max. memory is 16.1GB. [2025-02-05 15:40:48,496 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:40:48,497 INFO L158 Benchmark]: CACSL2BoogieTranslator took 618.78ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 72.1MB in the end (delta: 37.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-02-05 15:40:48,497 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.11ms. Allocated memory is still 142.6MB. Free memory was 72.1MB in the beginning and 67.2MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:40:48,497 INFO L158 Benchmark]: Boogie Preprocessor took 58.20ms. Allocated memory is still 142.6MB. Free memory was 67.2MB in the beginning and 62.5MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:40:48,497 INFO L158 Benchmark]: IcfgBuilder took 938.49ms. Allocated memory is still 142.6MB. Free memory was 62.5MB in the beginning and 61.3MB in the end (delta: 1.2MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2025-02-05 15:40:48,497 INFO L158 Benchmark]: TraceAbstraction took 4804.79ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 60.5MB in the beginning and 49.9MB in the end (delta: 10.6MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2025-02-05 15:40:48,497 INFO L158 Benchmark]: Witness Printer took 144.60ms. Allocated memory was 184.5MB in the beginning and 226.5MB in the end (delta: 41.9MB). Free memory was 49.9MB in the beginning and 178.9MB in the end (delta: -129.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:40:48,498 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 201.3MB. Free memory is still 124.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 618.78ms. Allocated memory is still 142.6MB. Free memory was 109.4MB in the beginning and 72.1MB in the end (delta: 37.4MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.11ms. Allocated memory is still 142.6MB. Free memory was 72.1MB in the beginning and 67.2MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 58.20ms. Allocated memory is still 142.6MB. Free memory was 67.2MB in the beginning and 62.5MB in the end (delta: 4.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 938.49ms. Allocated memory is still 142.6MB. Free memory was 62.5MB in the beginning and 61.3MB in the end (delta: 1.2MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. * TraceAbstraction took 4804.79ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 60.5MB in the beginning and 49.9MB in the end (delta: 10.6MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. * Witness Printer took 144.60ms. Allocated memory was 184.5MB in the beginning and 226.5MB in the end (delta: 41.9MB). Free memory was 49.9MB in the beginning and 178.9MB in the end (delta: -129.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResultAtLocation [Line: 48]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] - GenericResultAtLocation [Line: 167]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [167] - GenericResultAtLocation [Line: 392]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [392] - GenericResultAtLocation [Line: 409]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [409] - GenericResultAtLocation [Line: 447]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [447] - GenericResultAtLocation [Line: 851]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [851] - GenericResultAtLocation [Line: 1931]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1931] - GenericResultAtLocation [Line: 2297]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2297] - GenericResultAtLocation [Line: 2591]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2591] - GenericResultAtLocation [Line: 2600]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"DecryptAutoResponder_spec.i","") [2600] - GenericResultAtLocation [Line: 2619]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2619] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 2596]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 17 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 7, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 131 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 113 mSDsluCounter, 8536 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5640 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 136 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 2896 mSDtfsCounter, 136 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 554 GetRequests, 522 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=330occurred in iteration=5, InterpolantAutomatonStates: 28, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1263 NumberOfCodeBlocks, 1196 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1251 ConstructedInterpolants, 0 QuantifiedInterpolants, 1354 SizeOfPredicates, 3 NumberOfNonLiveVariables, 5110 ConjunctsInSsa, 20 ConjunctsInUnsatCore, 12 InterpolantComputations, 7 PerfectInterpolantSequences, 371/389 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-02-05 15:40:48,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE