./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec11_product07.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_product07.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 ca488828ecb96ea32a61c8f7cc33f9cc148887f4e62691829b51b0a2976db03e --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 15:40:28,664 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 15:40:28,712 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:28,715 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 15:40:28,715 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 15:40:28,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 15:40:28,729 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 15:40:28,729 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 15:40:28,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 15:40:28,729 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 15:40:28,730 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 15:40:28,730 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 15:40:28,730 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 15:40:28,730 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 15:40:28,730 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 15:40:28,730 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 15:40:28,730 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 15:40:28,730 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 15:40:28,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 15:40:28,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 15:40:28,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 15:40:28,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 15:40:28,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 15:40:28,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 15:40:28,730 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 15:40:28,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 15:40:28,730 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 15:40:28,731 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 15:40:28,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 15:40:28,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 15:40:28,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 15:40:28,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 15:40:28,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:40:28,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 15:40:28,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 15:40:28,731 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 15:40:28,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 15:40:28,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 15:40:28,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 15:40:28,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 15:40:28,731 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 15:40:28,731 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 15:40:28,731 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 15:40:28,731 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 -> ca488828ecb96ea32a61c8f7cc33f9cc148887f4e62691829b51b0a2976db03e [2025-02-05 15:40:28,944 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 15:40:28,951 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 15:40:28,953 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 15:40:28,954 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 15:40:28,954 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 15:40:28,956 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec11_product07.cil.c [2025-02-05 15:40:30,159 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f4a1567b/aab1eaac425442c7ab63e89a55b2a926/FLAGc8284881e [2025-02-05 15:40:30,454 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 15:40:30,455 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec11_product07.cil.c [2025-02-05 15:40:30,470 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f4a1567b/aab1eaac425442c7ab63e89a55b2a926/FLAGc8284881e [2025-02-05 15:40:30,743 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8f4a1567b/aab1eaac425442c7ab63e89a55b2a926 [2025-02-05 15:40:30,746 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 15:40:30,747 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 15:40:30,748 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 15:40:30,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 15:40:30,752 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 15:40:30,753 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:40:30" (1/1) ... [2025-02-05 15:40:30,754 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@235e7df7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:30, skipping insertion in model container [2025-02-05 15:40:30,755 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 03:40:30" (1/1) ... [2025-02-05 15:40:30,799 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 15:40:31,127 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_product07.cil.c[47468,47481] [2025-02-05 15:40:31,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:40:31,190 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 15:40:31,196 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2025-02-05 15:40:31,197 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [460] [2025-02-05 15:40:31,198 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1540] [2025-02-05 15:40:31,198 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1706] [2025-02-05 15:40:31,198 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1910] [2025-02-05 15:40:31,198 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1975] [2025-02-05 15:40:31,198 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2010] [2025-02-05 15:40:31,199 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2205] [2025-02-05 15:40:31,199 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2214] [2025-02-05 15:40:31,200 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptAutoResponder_spec.i","") [2580] [2025-02-05 15:40:31,200 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2599] [2025-02-05 15:40:31,267 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_product07.cil.c[47468,47481] [2025-02-05 15:40:31,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 15:40:31,307 INFO L204 MainTranslator]: Completed translation [2025-02-05 15:40:31,308 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:31 WrapperNode [2025-02-05 15:40:31,309 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 15:40:31,309 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 15:40:31,310 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 15:40:31,310 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 15:40:31,315 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:31" (1/1) ... [2025-02-05 15:40:31,329 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:31" (1/1) ... [2025-02-05 15:40:31,357 INFO L138 Inliner]: procedures = 110, calls = 128, calls flagged for inlining = 36, calls inlined = 30, statements flattened = 597 [2025-02-05 15:40:31,358 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 15:40:31,358 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 15:40:31,358 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 15:40:31,358 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 15:40:31,371 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:31" (1/1) ... [2025-02-05 15:40:31,371 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:31" (1/1) ... [2025-02-05 15:40:31,377 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:31" (1/1) ... [2025-02-05 15:40:31,393 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2025-02-05 15:40:31,393 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:31" (1/1) ... [2025-02-05 15:40:31,393 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:31" (1/1) ... [2025-02-05 15:40:31,401 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:31" (1/1) ... [2025-02-05 15:40:31,402 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:31" (1/1) ... [2025-02-05 15:40:31,404 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:31" (1/1) ... [2025-02-05 15:40:31,405 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:31" (1/1) ... [2025-02-05 15:40:31,411 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 15:40:31,412 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 15:40:31,412 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 15:40:31,412 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 15:40:31,412 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:31" (1/1) ... [2025-02-05 15:40:31,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 15:40:31,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:31,442 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:31,444 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:31,461 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-02-05 15:40:31,462 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-02-05 15:40:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-02-05 15:40:31,462 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-02-05 15:40:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-02-05 15:40:31,462 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-02-05 15:40:31,462 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:40:31,462 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-02-05 15:40:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-02-05 15:40:31,463 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-02-05 15:40:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-02-05 15:40:31,463 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-02-05 15:40:31,463 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-02-05 15:40:31,463 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-02-05 15:40:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-02-05 15:40:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-02-05 15:40:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 15:40:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-02-05 15:40:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-02-05 15:40:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-02-05 15:40:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-02-05 15:40:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-02-05 15:40:31,464 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-02-05 15:40:31,464 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-02-05 15:40:31,465 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-02-05 15:40:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 15:40:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 15:40:31,465 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-02-05 15:40:31,465 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-02-05 15:40:31,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 15:40:31,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 15:40:31,583 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 15:40:31,585 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 15:40:31,656 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L178: #res := ~retValue_acc~3; [2025-02-05 15:40:31,677 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1972-1: createEmail_#res#1 := createEmail_~retValue_acc~35#1; [2025-02-05 15:40:31,685 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L626: #res := ~retValue_acc~14; [2025-02-05 15:40:31,714 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L952: #res := ~retValue_acc~18; [2025-02-05 15:40:31,781 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1035-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~19#1; [2025-02-05 15:40:31,781 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1517-1: getClientId_#res#1 := getClientId_~retValue_acc~27#1; [2025-02-05 15:40:31,955 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1861-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~30#1; [2025-02-05 15:40:31,955 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1870-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~31#1; [2025-02-05 15:40:31,955 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1879-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~32#1; [2025-02-05 15:40:31,955 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L2007-1: valid_product_#res#1 := valid_product_~retValue_acc~37#1; [2025-02-05 15:40:31,961 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L141: #res := ~retValue_acc~2; [2025-02-05 15:40:31,983 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1948: #res := ~retValue_acc~33; [2025-02-05 15:40:32,056 INFO L? ?]: Removed 260 outVars from TransFormulas that were not future-live. [2025-02-05 15:40:32,057 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 15:40:32,074 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 15:40:32,076 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 15:40:32,077 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:40:32 BoogieIcfgContainer [2025-02-05 15:40:32,077 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 15:40:32,079 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 15:40:32,079 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 15:40:32,083 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 15:40:32,083 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 03:40:30" (1/3) ... [2025-02-05 15:40:32,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6147e4a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:40:32, skipping insertion in model container [2025-02-05 15:40:32,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 03:40:31" (2/3) ... [2025-02-05 15:40:32,084 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6147e4a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 03:40:32, skipping insertion in model container [2025-02-05 15:40:32,084 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 03:40:32" (3/3) ... [2025-02-05 15:40:32,085 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec11_product07.cil.c [2025-02-05 15:40:32,095 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 15:40:32,099 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec11_product07.cil.c that has 14 procedures, 204 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 15:40:32,156 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 15:40:32,164 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;@48b51b4c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 15:40:32,165 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 15:40:32,168 INFO L276 IsEmpty]: Start isEmpty. Operand has 204 states, 164 states have (on average 1.5609756097560976) internal successors, (256), 167 states have internal predecessors, (256), 25 states have call successors, (25), 13 states have call predecessors, (25), 13 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) [2025-02-05 15:40:32,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2025-02-05 15:40:32,180 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:32,181 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:32,181 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:32,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:32,186 INFO L85 PathProgramCache]: Analyzing trace with hash 575283419, now seen corresponding path program 1 times [2025-02-05 15:40:32,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:32,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130322119] [2025-02-05 15:40:32,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:32,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:32,273 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 15:40:32,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 15:40:32,322 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:32,322 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:32,647 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 15:40:32,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:32,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130322119] [2025-02-05 15:40:32,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130322119] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:32,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1785674458] [2025-02-05 15:40:32,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:32,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:32,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:32,652 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:32,654 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:32,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 78 statements into 1 equivalence classes. [2025-02-05 15:40:32,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 78 of 78 statements. [2025-02-05 15:40:32,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:32,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:32,890 INFO L256 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 15:40:32,896 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:32,913 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:40:32,914 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:32,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1785674458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:32,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:32,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-02-05 15:40:32,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706674403] [2025-02-05 15:40:32,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:32,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 15:40:32,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:32,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 15:40:32,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:32,942 INFO L87 Difference]: Start difference. First operand has 204 states, 164 states have (on average 1.5609756097560976) internal successors, (256), 167 states have internal predecessors, (256), 25 states have call successors, (25), 13 states have call predecessors, (25), 13 states have return successors, (25), 24 states have call predecessors, (25), 25 states have call successors, (25) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:40:32,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:32,969 INFO L93 Difference]: Finished difference Result 320 states and 469 transitions. [2025-02-05 15:40:32,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 15:40:32,972 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 78 [2025-02-05 15:40:32,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:32,979 INFO L225 Difference]: With dead ends: 320 [2025-02-05 15:40:32,980 INFO L226 Difference]: Without dead ends: 197 [2025-02-05 15:40:32,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 79 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:32,986 INFO L435 NwaCegarLoop]: 303 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, 303 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:32,986 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 303 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:32,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2025-02-05 15:40:33,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2025-02-05 15:40:33,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 158 states have (on average 1.5569620253164558) internal successors, (246), 160 states have internal predecessors, (246), 25 states have call successors, (25), 13 states have call predecessors, (25), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 15:40:33,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 295 transitions. [2025-02-05 15:40:33,034 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 295 transitions. Word has length 78 [2025-02-05 15:40:33,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:33,035 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 295 transitions. [2025-02-05 15:40:33,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:40:33,035 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 295 transitions. [2025-02-05 15:40:33,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-05 15:40:33,041 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:33,041 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:33,050 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:33,242 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:33,242 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:33,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:33,243 INFO L85 PathProgramCache]: Analyzing trace with hash -698505498, now seen corresponding path program 1 times [2025-02-05 15:40:33,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:33,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631982808] [2025-02-05 15:40:33,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:33,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:33,268 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 15:40:33,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 15:40:33,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:33,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:33,462 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 15:40:33,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:33,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631982808] [2025-02-05 15:40:33,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631982808] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:33,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923044111] [2025-02-05 15:40:33,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:33,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:33,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:33,465 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:33,467 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:33,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-05 15:40:33,682 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-05 15:40:33,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:33,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:33,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 814 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 15:40:33,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:33,714 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-05 15:40:33,717 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:33,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923044111] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:33,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:33,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-02-05 15:40:33,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627132163] [2025-02-05 15:40:33,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:33,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:33,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:33,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:33,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 15:40:33,720 INFO L87 Difference]: Start difference. First operand 197 states and 295 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:40:33,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:33,758 INFO L93 Difference]: Finished difference Result 309 states and 447 transitions. [2025-02-05 15:40:33,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:33,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 79 [2025-02-05 15:40:33,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:33,762 INFO L225 Difference]: With dead ends: 309 [2025-02-05 15:40:33,762 INFO L226 Difference]: Without dead ends: 199 [2025-02-05 15:40:33,763 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 79 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:33,763 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 0 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 586 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:33,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 586 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:33,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2025-02-05 15:40:33,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2025-02-05 15:40:33,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 199 states, 160 states have (on average 1.55) internal successors, (248), 162 states have internal predecessors, (248), 25 states have call successors, (25), 13 states have call predecessors, (25), 13 states have return successors, (24), 23 states have call predecessors, (24), 24 states have call successors, (24) [2025-02-05 15:40:33,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 297 transitions. [2025-02-05 15:40:33,784 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 297 transitions. Word has length 79 [2025-02-05 15:40:33,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:33,785 INFO L471 AbstractCegarLoop]: Abstraction has 199 states and 297 transitions. [2025-02-05 15:40:33,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:40:33,785 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 297 transitions. [2025-02-05 15:40:33,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-02-05 15:40:33,786 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:33,786 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:33,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 15:40:33,986 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:33,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:33,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:33,987 INFO L85 PathProgramCache]: Analyzing trace with hash 544222754, now seen corresponding path program 1 times [2025-02-05 15:40:33,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:33,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374415999] [2025-02-05 15:40:33,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:33,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:34,027 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 15:40:34,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 15:40:34,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:34,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:34,182 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:40:34,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:34,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374415999] [2025-02-05 15:40:34,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374415999] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:34,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [281406239] [2025-02-05 15:40:34,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:34,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:34,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:34,187 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:34,189 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:34,297 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-02-05 15:40:34,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-02-05 15:40:34,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:34,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:34,399 INFO L256 TraceCheckSpWp]: Trace formula consists of 825 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-05 15:40:34,402 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:34,445 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-02-05 15:40:34,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 15:40:34,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [281406239] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:34,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 15:40:34,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-02-05 15:40:34,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083705715] [2025-02-05 15:40:34,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:34,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:34,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:34,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:34,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 15:40:34,447 INFO L87 Difference]: Start difference. First operand 199 states and 297 transitions. Second operand has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:40:34,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:34,503 INFO L93 Difference]: Finished difference Result 391 states and 587 transitions. [2025-02-05 15:40:34,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:34,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 83 [2025-02-05 15:40:34,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:34,506 INFO L225 Difference]: With dead ends: 391 [2025-02-05 15:40:34,508 INFO L226 Difference]: Without dead ends: 201 [2025-02-05 15:40:34,509 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 81 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:34,510 INFO L435 NwaCegarLoop]: 287 mSDtfsCounter, 2 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1137 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:34,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1137 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:34,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-05 15:40:34,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-02-05 15:40:34,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 161 states have (on average 1.546583850931677) internal successors, (249), 164 states have internal predecessors, (249), 25 states have call successors, (25), 13 states have call predecessors, (25), 14 states have return successors, (26), 23 states have call predecessors, (26), 24 states have call successors, (26) [2025-02-05 15:40:34,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 300 transitions. [2025-02-05 15:40:34,528 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 300 transitions. Word has length 83 [2025-02-05 15:40:34,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:34,528 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 300 transitions. [2025-02-05 15:40:34,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.5) internal successors, (58), 5 states have internal predecessors, (58), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:40:34,528 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 300 transitions. [2025-02-05 15:40:34,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2025-02-05 15:40:34,531 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:34,532 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:40:34,539 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 15:40:34,732 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:34,732 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:34,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:34,733 INFO L85 PathProgramCache]: Analyzing trace with hash 927480784, now seen corresponding path program 1 times [2025-02-05 15:40:34,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:34,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001533786] [2025-02-05 15:40:34,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:34,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:34,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 84 statements into 1 equivalence classes. [2025-02-05 15:40:34,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 84 of 84 statements. [2025-02-05 15:40:34,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:34,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:34,853 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:40:34,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:34,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001533786] [2025-02-05 15:40:34,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001533786] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:34,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:34,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:40:34,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858208886] [2025-02-05 15:40:34,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:34,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:34,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:34,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:34,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:34,855 INFO L87 Difference]: Start difference. First operand 201 states and 300 transitions. Second operand has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:40:34,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:34,895 INFO L93 Difference]: Finished difference Result 383 states and 575 transitions. [2025-02-05 15:40:34,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:34,898 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 84 [2025-02-05 15:40:34,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:34,899 INFO L225 Difference]: With dead ends: 383 [2025-02-05 15:40:34,899 INFO L226 Difference]: Without dead ends: 201 [2025-02-05 15:40:34,900 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:34,900 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 2 mSDsluCounter, 853 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1141 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:34,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1141 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:34,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2025-02-05 15:40:34,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2025-02-05 15:40:34,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 161 states have (on average 1.546583850931677) internal successors, (249), 164 states have internal predecessors, (249), 25 states have call successors, (25), 13 states have call predecessors, (25), 14 states have return successors, (25), 23 states have call predecessors, (25), 24 states have call successors, (25) [2025-02-05 15:40:34,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 299 transitions. [2025-02-05 15:40:34,917 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 299 transitions. Word has length 84 [2025-02-05 15:40:34,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:34,917 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 299 transitions. [2025-02-05 15:40:34,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.25) internal successors, (57), 5 states have internal predecessors, (57), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:40:34,917 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 299 transitions. [2025-02-05 15:40:34,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2025-02-05 15:40:34,918 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:34,918 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:40:34,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 15:40:34,918 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:34,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:34,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1293572056, now seen corresponding path program 2 times [2025-02-05 15:40:34,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:34,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235065468] [2025-02-05 15:40:34,919 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:40:34,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:34,935 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 85 statements into 2 equivalence classes. [2025-02-05 15:40:34,942 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 43 of 85 statements. [2025-02-05 15:40:34,944 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:40:34,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:35,012 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-05 15:40:35,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:35,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235065468] [2025-02-05 15:40:35,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235065468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:35,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:35,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:40:35,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088311111] [2025-02-05 15:40:35,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:35,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:35,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:35,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:35,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:35,016 INFO L87 Difference]: Start difference. First operand 201 states and 299 transitions. Second operand has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:40:35,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:35,070 INFO L93 Difference]: Finished difference Result 483 states and 715 transitions. [2025-02-05 15:40:35,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:35,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 85 [2025-02-05 15:40:35,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:35,073 INFO L225 Difference]: With dead ends: 483 [2025-02-05 15:40:35,074 INFO L226 Difference]: Without dead ends: 381 [2025-02-05 15:40:35,075 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:40:35,076 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 256 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 256 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:35,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [256 Valid, 1144 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:35,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-02-05 15:40:35,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 379. [2025-02-05 15:40:35,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 305 states have (on average 1.5672131147540984) internal successors, (478), 310 states have internal predecessors, (478), 47 states have call successors, (47), 25 states have call predecessors, (47), 26 states have return successors, (46), 43 states have call predecessors, (46), 45 states have call successors, (46) [2025-02-05 15:40:35,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 571 transitions. [2025-02-05 15:40:35,091 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 571 transitions. Word has length 85 [2025-02-05 15:40:35,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:35,091 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 571 transitions. [2025-02-05 15:40:35,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.8) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:40:35,091 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 571 transitions. [2025-02-05 15:40:35,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-02-05 15:40:35,092 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:35,093 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-02-05 15:40:35,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 15:40:35,093 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:35,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:35,093 INFO L85 PathProgramCache]: Analyzing trace with hash 653722098, now seen corresponding path program 1 times [2025-02-05 15:40:35,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:35,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871244011] [2025-02-05 15:40:35,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:35,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:35,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-02-05 15:40:35,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-02-05 15:40:35,110 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:35,110 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:35,223 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-05 15:40:35,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:35,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871244011] [2025-02-05 15:40:35,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871244011] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:35,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:35,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:40:35,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199626795] [2025-02-05 15:40:35,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:35,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:35,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:35,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:35,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:35,225 INFO L87 Difference]: Start difference. First operand 379 states and 571 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:40:35,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:35,272 INFO L93 Difference]: Finished difference Result 741 states and 1122 transitions. [2025-02-05 15:40:35,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:35,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 86 [2025-02-05 15:40:35,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:35,276 INFO L225 Difference]: With dead ends: 741 [2025-02-05 15:40:35,276 INFO L226 Difference]: Without dead ends: 381 [2025-02-05 15:40:35,277 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:35,277 INFO L435 NwaCegarLoop]: 289 mSDtfsCounter, 1 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1144 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:35,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1144 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:35,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2025-02-05 15:40:35,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 381. [2025-02-05 15:40:35,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 306 states have (on average 1.565359477124183) internal successors, (479), 312 states have internal predecessors, (479), 47 states have call successors, (47), 25 states have call predecessors, (47), 27 states have return successors, (48), 43 states have call predecessors, (48), 45 states have call successors, (48) [2025-02-05 15:40:35,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 574 transitions. [2025-02-05 15:40:35,298 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 574 transitions. Word has length 86 [2025-02-05 15:40:35,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:35,299 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 574 transitions. [2025-02-05 15:40:35,299 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 3 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-02-05 15:40:35,299 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 574 transitions. [2025-02-05 15:40:35,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-02-05 15:40:35,302 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:35,302 INFO L218 NwaCegarLoop]: trace histogram [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:35,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 15:40:35,302 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:35,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:35,303 INFO L85 PathProgramCache]: Analyzing trace with hash -208384041, now seen corresponding path program 1 times [2025-02-05 15:40:35,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:35,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69508272] [2025-02-05 15:40:35,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:35,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:35,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 15:40:35,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 15:40:35,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:35,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:35,402 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 15:40:35,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:35,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69508272] [2025-02-05 15:40:35,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69508272] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 15:40:35,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [511228383] [2025-02-05 15:40:35,403 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:35,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 15:40:35,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 15:40:35,406 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:35,408 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:35,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-02-05 15:40:35,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-02-05 15:40:35,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:35,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:35,598 INFO L256 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-02-05 15:40:35,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 15:40:35,617 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 15:40:35,618 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 15:40:35,705 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 15:40:35,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [511228383] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 15:40:35,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 15:40:35,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-02-05 15:40:35,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734257233] [2025-02-05 15:40:35,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 15:40:35,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 15:40:35,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:35,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 15:40:35,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:40:35,708 INFO L87 Difference]: Start difference. First operand 381 states and 574 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:40:35,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:35,783 INFO L93 Difference]: Finished difference Result 880 states and 1363 transitions. [2025-02-05 15:40:35,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 15:40:35,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 87 [2025-02-05 15:40:35,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:35,787 INFO L225 Difference]: With dead ends: 880 [2025-02-05 15:40:35,788 INFO L226 Difference]: Without dead ends: 660 [2025-02-05 15:40:35,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-02-05 15:40:35,789 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 334 mSDsluCounter, 1050 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 1344 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 15:40:35,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 1344 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 15:40:35,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2025-02-05 15:40:35,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 620. [2025-02-05 15:40:35,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 530 states have (on average 1.6754716981132076) internal successors, (888), 536 states have internal predecessors, (888), 62 states have call successors, (62), 25 states have call predecessors, (62), 27 states have return successors, (63), 58 states have call predecessors, (63), 60 states have call successors, (63) [2025-02-05 15:40:35,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 1013 transitions. [2025-02-05 15:40:35,815 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 1013 transitions. Word has length 87 [2025-02-05 15:40:35,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:35,816 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 1013 transitions. [2025-02-05 15:40:35,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 7 states have internal predecessors, (82), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-02-05 15:40:35,816 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 1013 transitions. [2025-02-05 15:40:35,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-02-05 15:40:35,819 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:35,819 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:35,827 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:36,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-02-05 15:40:36,020 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:36,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:36,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1646521749, now seen corresponding path program 1 times [2025-02-05 15:40:36,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:36,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407579837] [2025-02-05 15:40:36,020 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:36,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:36,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-02-05 15:40:36,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-02-05 15:40:36,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:36,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:36,066 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 15:40:36,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:36,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407579837] [2025-02-05 15:40:36,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407579837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:36,066 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:36,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:36,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803147329] [2025-02-05 15:40:36,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:36,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:36,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:36,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:36,067 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:36,067 INFO L87 Difference]: Start difference. First operand 620 states and 1013 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:40:36,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:36,090 INFO L93 Difference]: Finished difference Result 1465 states and 2442 transitions. [2025-02-05 15:40:36,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:36,090 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 94 [2025-02-05 15:40:36,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:36,094 INFO L225 Difference]: With dead ends: 1465 [2025-02-05 15:40:36,094 INFO L226 Difference]: Without dead ends: 872 [2025-02-05 15:40:36,096 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:36,096 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 84 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 585 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:36,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 585 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:36,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-02-05 15:40:36,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 856. [2025-02-05 15:40:36,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 856 states, 751 states have (on average 1.7097203728362185) internal successors, (1284), 757 states have internal predecessors, (1284), 77 states have call successors, (77), 25 states have call predecessors, (77), 27 states have return successors, (78), 73 states have call predecessors, (78), 75 states have call successors, (78) [2025-02-05 15:40:36,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 856 states to 856 states and 1439 transitions. [2025-02-05 15:40:36,123 INFO L78 Accepts]: Start accepts. Automaton has 856 states and 1439 transitions. Word has length 94 [2025-02-05 15:40:36,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:36,123 INFO L471 AbstractCegarLoop]: Abstraction has 856 states and 1439 transitions. [2025-02-05 15:40:36,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:40:36,123 INFO L276 IsEmpty]: Start isEmpty. Operand 856 states and 1439 transitions. [2025-02-05 15:40:36,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-02-05 15:40:36,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:36,126 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:36,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 15:40:36,126 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:36,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:36,126 INFO L85 PathProgramCache]: Analyzing trace with hash -513286120, now seen corresponding path program 1 times [2025-02-05 15:40:36,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:36,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715743472] [2025-02-05 15:40:36,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:36,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:36,138 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-02-05 15:40:36,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-02-05 15:40:36,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:36,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:36,168 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 15:40:36,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:36,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715743472] [2025-02-05 15:40:36,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715743472] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:36,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:36,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:36,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565672440] [2025-02-05 15:40:36,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:36,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:36,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:36,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:36,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:36,169 INFO L87 Difference]: Start difference. First operand 856 states and 1439 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:40:36,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:36,212 INFO L93 Difference]: Finished difference Result 1996 states and 3418 transitions. [2025-02-05 15:40:36,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:36,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 95 [2025-02-05 15:40:36,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:36,217 INFO L225 Difference]: With dead ends: 1996 [2025-02-05 15:40:36,218 INFO L226 Difference]: Without dead ends: 1277 [2025-02-05 15:40:36,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:36,219 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 82 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 576 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:36,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 576 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:36,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2025-02-05 15:40:36,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 1261. [2025-02-05 15:40:36,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1261 states, 1126 states have (on average 1.7486678507992894) internal successors, (1969), 1132 states have internal predecessors, (1969), 107 states have call successors, (107), 25 states have call predecessors, (107), 27 states have return successors, (108), 103 states have call predecessors, (108), 105 states have call successors, (108) [2025-02-05 15:40:36,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1261 states to 1261 states and 2184 transitions. [2025-02-05 15:40:36,259 INFO L78 Accepts]: Start accepts. Automaton has 1261 states and 2184 transitions. Word has length 95 [2025-02-05 15:40:36,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:36,259 INFO L471 AbstractCegarLoop]: Abstraction has 1261 states and 2184 transitions. [2025-02-05 15:40:36,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:40:36,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1261 states and 2184 transitions. [2025-02-05 15:40:36,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-02-05 15:40:36,263 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:36,263 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:36,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 15:40:36,263 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:36,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:36,264 INFO L85 PathProgramCache]: Analyzing trace with hash -428229078, now seen corresponding path program 1 times [2025-02-05 15:40:36,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:36,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694400579] [2025-02-05 15:40:36,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:36,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:36,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-02-05 15:40:36,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-02-05 15:40:36,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:36,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:36,318 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 15:40:36,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:36,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694400579] [2025-02-05 15:40:36,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694400579] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:36,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:36,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:36,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309416518] [2025-02-05 15:40:36,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:36,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:36,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:36,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:36,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:36,319 INFO L87 Difference]: Start difference. First operand 1261 states and 2184 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:40:36,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:36,363 INFO L93 Difference]: Finished difference Result 3071 states and 5379 transitions. [2025-02-05 15:40:36,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:36,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 96 [2025-02-05 15:40:36,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:36,373 INFO L225 Difference]: With dead ends: 3071 [2025-02-05 15:40:36,373 INFO L226 Difference]: Without dead ends: 1900 [2025-02-05 15:40:36,377 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:36,378 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 80 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 584 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:36,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 584 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:36,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1900 states. [2025-02-05 15:40:36,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1900 to 1884. [2025-02-05 15:40:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1884 states, 1707 states have (on average 1.7539543057996485) internal successors, (2994), 1713 states have internal predecessors, (2994), 149 states have call successors, (149), 25 states have call predecessors, (149), 27 states have return successors, (150), 145 states have call predecessors, (150), 147 states have call successors, (150) [2025-02-05 15:40:36,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1884 states to 1884 states and 3293 transitions. [2025-02-05 15:40:36,446 INFO L78 Accepts]: Start accepts. Automaton has 1884 states and 3293 transitions. Word has length 96 [2025-02-05 15:40:36,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:36,447 INFO L471 AbstractCegarLoop]: Abstraction has 1884 states and 3293 transitions. [2025-02-05 15:40:36,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:40:36,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1884 states and 3293 transitions. [2025-02-05 15:40:36,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 15:40:36,454 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:36,455 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:36,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 15:40:36,455 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:36,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:36,456 INFO L85 PathProgramCache]: Analyzing trace with hash -686377511, now seen corresponding path program 1 times [2025-02-05 15:40:36,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:36,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685097337] [2025-02-05 15:40:36,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:36,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:36,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 15:40:36,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 15:40:36,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:36,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 15:40:36,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:36,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685097337] [2025-02-05 15:40:36,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685097337] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:36,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:36,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:36,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139380862] [2025-02-05 15:40:36,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:36,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:36,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:36,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:36,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:36,505 INFO L87 Difference]: Start difference. First operand 1884 states and 3293 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:40:36,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:36,580 INFO L93 Difference]: Finished difference Result 4625 states and 8169 transitions. [2025-02-05 15:40:36,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:36,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 97 [2025-02-05 15:40:36,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:36,593 INFO L225 Difference]: With dead ends: 4625 [2025-02-05 15:40:36,594 INFO L226 Difference]: Without dead ends: 2912 [2025-02-05 15:40:36,598 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:36,599 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 78 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 584 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:36,599 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 584 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:36,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2912 states. [2025-02-05 15:40:36,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2912 to 2896. [2025-02-05 15:40:36,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2896 states, 2650 states have (on average 1.7532075471698114) internal successors, (4646), 2656 states have internal predecessors, (4646), 218 states have call successors, (218), 25 states have call predecessors, (218), 27 states have return successors, (219), 214 states have call predecessors, (219), 216 states have call successors, (219) [2025-02-05 15:40:36,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2896 states to 2896 states and 5083 transitions. [2025-02-05 15:40:36,694 INFO L78 Accepts]: Start accepts. Automaton has 2896 states and 5083 transitions. Word has length 97 [2025-02-05 15:40:36,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:36,695 INFO L471 AbstractCegarLoop]: Abstraction has 2896 states and 5083 transitions. [2025-02-05 15:40:36,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:40:36,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2896 states and 5083 transitions. [2025-02-05 15:40:36,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-02-05 15:40:36,704 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:36,704 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:36,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 15:40:36,705 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:36,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:36,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1252211113, now seen corresponding path program 1 times [2025-02-05 15:40:36,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:36,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959410621] [2025-02-05 15:40:36,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 15:40:36,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:36,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-02-05 15:40:36,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-02-05 15:40:36,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 15:40:36,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:36,753 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-05 15:40:36,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:36,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959410621] [2025-02-05 15:40:36,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959410621] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:36,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:36,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 15:40:36,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571557253] [2025-02-05 15:40:36,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:36,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 15:40:36,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:36,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 15:40:36,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:36,756 INFO L87 Difference]: Start difference. First operand 2896 states and 5083 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:40:36,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:36,846 INFO L93 Difference]: Finished difference Result 7238 states and 12841 transitions. [2025-02-05 15:40:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 15:40:36,847 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2025-02-05 15:40:36,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:36,865 INFO L225 Difference]: With dead ends: 7238 [2025-02-05 15:40:36,866 INFO L226 Difference]: Without dead ends: 4639 [2025-02-05 15:40:36,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 15:40:36,872 INFO L435 NwaCegarLoop]: 294 mSDtfsCounter, 76 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 584 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:36,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 584 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:36,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4639 states. [2025-02-05 15:40:36,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4639 to 4623. [2025-02-05 15:40:36,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4623 states, 4257 states have (on average 1.7505285412262157) internal successors, (7452), 4263 states have internal predecessors, (7452), 338 states have call successors, (338), 25 states have call predecessors, (338), 27 states have return successors, (339), 334 states have call predecessors, (339), 336 states have call successors, (339) [2025-02-05 15:40:36,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4623 states to 4623 states and 8129 transitions. [2025-02-05 15:40:36,999 INFO L78 Accepts]: Start accepts. Automaton has 4623 states and 8129 transitions. Word has length 98 [2025-02-05 15:40:36,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:36,999 INFO L471 AbstractCegarLoop]: Abstraction has 4623 states and 8129 transitions. [2025-02-05 15:40:36,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-02-05 15:40:36,999 INFO L276 IsEmpty]: Start isEmpty. Operand 4623 states and 8129 transitions. [2025-02-05 15:40:37,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-02-05 15:40:37,011 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 15:40:37,011 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:37,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 15:40:37,011 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 15:40:37,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 15:40:37,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2138769885, now seen corresponding path program 2 times [2025-02-05 15:40:37,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 15:40:37,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1270205126] [2025-02-05 15:40:37,012 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-05 15:40:37,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 15:40:37,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 99 statements into 2 equivalence classes. [2025-02-05 15:40:37,044 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 99 statements. [2025-02-05 15:40:37,044 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-02-05 15:40:37,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 15:40:37,087 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-02-05 15:40:37,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 15:40:37,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1270205126] [2025-02-05 15:40:37,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1270205126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 15:40:37,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 15:40:37,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 15:40:37,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749206548] [2025-02-05 15:40:37,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 15:40:37,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 15:40:37,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 15:40:37,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 15:40:37,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 15:40:37,089 INFO L87 Difference]: Start difference. First operand 4623 states and 8129 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-05 15:40:37,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 15:40:37,149 INFO L93 Difference]: Finished difference Result 4623 states and 8129 transitions. [2025-02-05 15:40:37,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 15:40:37,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 99 [2025-02-05 15:40:37,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 15:40:37,151 INFO L225 Difference]: With dead ends: 4623 [2025-02-05 15:40:37,151 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 15:40:37,158 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:37,158 INFO L435 NwaCegarLoop]: 291 mSDtfsCounter, 0 mSDsluCounter, 866 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1157 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:37,159 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1157 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:37,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 15:40:37,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 15:40:37,159 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:37,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 15:40:37,161 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2025-02-05 15:40:37,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 15:40:37,161 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 15:40:37,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 4 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2025-02-05 15:40:37,161 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 15:40:37,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 15:40:37,163 INFO L782 garLoopResultBuilder]: Registering result SAFE for location outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 15:40:37,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 15:40:37,167 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 15:40:37,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 15:40:37,273 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 15:40:37,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 03:40:37 BoogieIcfgContainer [2025-02-05 15:40:37,284 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 15:40:37,285 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 15:40:37,285 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 15:40:37,285 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 15:40:37,286 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:32" (3/4) ... [2025-02-05 15:40:37,287 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 15:40:37,294 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure outgoing [2025-02-05 15:40:37,294 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setEmailTo [2025-02-05 15:40:37,294 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure getEmailTo [2025-02-05 15:40:37,294 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setClientAddressBookSize [2025-02-05 15:40:37,294 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure sendEmail [2025-02-05 15:40:37,294 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure getClientAddressBookSize [2025-02-05 15:40:37,294 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure getClientAddressBookAddress [2025-02-05 15:40:37,294 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure outgoing__wrappee__AutoResponder [2025-02-05 15:40:37,294 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setEmailFrom [2025-02-05 15:40:37,295 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure getEmailFrom [2025-02-05 15:40:37,295 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setClientAddressBookAddress [2025-02-05 15:40:37,295 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure isReadable [2025-02-05 15:40:37,295 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure setClientId [2025-02-05 15:40:37,313 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 55 nodes and edges [2025-02-05 15:40:37,314 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2025-02-05 15:40:37,315 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2025-02-05 15:40:37,316 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2025-02-05 15:40:37,316 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 15:40:37,317 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 15:40:37,433 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 15:40:37,433 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 15:40:37,433 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 15:40:37,434 INFO L158 Benchmark]: Toolchain (without parser) took 6687.37ms. Allocated memory was 167.8MB in the beginning and 293.6MB in the end (delta: 125.8MB). Free memory was 121.0MB in the beginning and 246.3MB in the end (delta: -125.2MB). Peak memory consumption was 108.3MB. Max. memory is 16.1GB. [2025-02-05 15:40:37,435 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:40:37,435 INFO L158 Benchmark]: CACSL2BoogieTranslator took 561.44ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 86.0MB in the end (delta: 34.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 15:40:37,435 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.27ms. Allocated memory is still 167.8MB. Free memory was 86.0MB in the beginning and 82.0MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 15:40:37,435 INFO L158 Benchmark]: Boogie Preprocessor took 53.00ms. Allocated memory is still 167.8MB. Free memory was 82.0MB in the beginning and 78.6MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 15:40:37,436 INFO L158 Benchmark]: IcfgBuilder took 665.27ms. Allocated memory is still 167.8MB. Free memory was 78.2MB in the beginning and 114.5MB in the end (delta: -36.2MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. [2025-02-05 15:40:37,436 INFO L158 Benchmark]: TraceAbstraction took 5205.19ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 113.6MB in the beginning and 60.4MB in the end (delta: 53.2MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. [2025-02-05 15:40:37,436 INFO L158 Benchmark]: Witness Printer took 148.75ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 60.4MB in the beginning and 246.3MB in the end (delta: -185.8MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2025-02-05 15:40:37,438 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.19ms. Allocated memory is still 201.3MB. Free memory is still 120.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 561.44ms. Allocated memory is still 167.8MB. Free memory was 120.7MB in the beginning and 86.0MB in the end (delta: 34.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.27ms. Allocated memory is still 167.8MB. Free memory was 86.0MB in the beginning and 82.0MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.00ms. Allocated memory is still 167.8MB. Free memory was 82.0MB in the beginning and 78.6MB in the end (delta: 3.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 665.27ms. Allocated memory is still 167.8MB. Free memory was 78.2MB in the beginning and 114.5MB in the end (delta: -36.2MB). Peak memory consumption was 57.6MB. Max. memory is 16.1GB. * TraceAbstraction took 5205.19ms. Allocated memory was 167.8MB in the beginning and 201.3MB in the end (delta: 33.6MB). Free memory was 113.6MB in the beginning and 60.4MB in the end (delta: 53.2MB). Peak memory consumption was 83.6MB. Max. memory is 16.1GB. * Witness Printer took 148.75ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 60.4MB in the beginning and 246.3MB in the end (delta: -185.8MB). Peak memory consumption was 17.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,"EmailLib.i","") [48] - GenericResultAtLocation [Line: 460]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [460] - GenericResultAtLocation [Line: 1540]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1540] - GenericResultAtLocation [Line: 1706]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1706] - GenericResultAtLocation [Line: 1910]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1910] - GenericResultAtLocation [Line: 1975]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1975] - GenericResultAtLocation [Line: 2010]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2010] - GenericResultAtLocation [Line: 2205]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2205] - GenericResultAtLocation [Line: 2214]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2214] - GenericResultAtLocation [Line: 2580]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"DecryptAutoResponder_spec.i","") [2580] - GenericResultAtLocation [Line: 2599]: Unsoundness Warning Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2599] * 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: 2210]: 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 14 procedures, 204 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.0s, OverallIterations: 13, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1030 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 995 mSDsluCounter, 10869 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 7058 mSDsCounter, 10 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 179 IncrementalHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 10 mSolverCounterUnsat, 3811 mSDtfsCounter, 179 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4623occurred in iteration=12, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 13 MinimizatonAttempts, 122 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1488 NumberOfCodeBlocks, 1392 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 1557 ConstructedInterpolants, 0 QuantifiedInterpolants, 1811 SizeOfPredicates, 1 NumberOfNonLiveVariables, 3281 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 18 InterpolantComputations, 12 PerfectInterpolantSequences, 332/347 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:37,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE