./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_product25.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec27_product25.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c862f9fbd969695db1625134466cee856e407b57f937740cfce5c982a0b9c02a --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:22:20,160 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:22:20,209 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:22:20,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:22:20,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:22:20,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:22:20,239 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:22:20,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:22:20,240 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:22:20,240 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:22:20,240 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:22:20,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:22:20,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:22:20,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:22:20,240 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:22:20,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:22:20,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:22:20,240 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:22:20,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:22:20,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:22:20,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:22:20,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:22:20,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:22:20,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:22:20,241 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:22:20,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:22:20,241 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:22:20,241 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:22:20,241 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:22:20,241 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:22:20,241 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:22:20,241 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:22:20,241 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:22:20,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:22:20,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:22:20,243 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:22:20,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:22:20,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:22:20,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:22:20,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:22:20,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:22:20,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:22:20,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:22:20,243 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c862f9fbd969695db1625134466cee856e407b57f937740cfce5c982a0b9c02a [2025-03-03 14:22:20,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:22:20,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:22:20,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:22:20,516 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:22:20,517 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:22:20,518 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product25.cil.c [2025-03-03 14:22:21,681 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1554ea169/2bcf6b8be88d404183259fa39362f77b/FLAGd88241eb6 [2025-03-03 14:22:21,985 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:22:21,987 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product25.cil.c [2025-03-03 14:22:22,006 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1554ea169/2bcf6b8be88d404183259fa39362f77b/FLAGd88241eb6 [2025-03-03 14:22:22,021 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1554ea169/2bcf6b8be88d404183259fa39362f77b [2025-03-03 14:22:22,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:22:22,025 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:22:22,026 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:22:22,027 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:22:22,030 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:22:22,031 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:22:22" (1/1) ... [2025-03-03 14:22:22,032 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d3d6a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:22, skipping insertion in model container [2025-03-03 14:22:22,032 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:22:22" (1/1) ... [2025-03-03 14:22:22,082 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:22:22,504 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product25.cil.c[58911,58924] [2025-03-03 14:22:22,528 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:22:22,542 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:22:22,547 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [48] [2025-03-03 14:22:22,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [418] [2025-03-03 14:22:22,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1490] [2025-03-03 14:22:22,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1588] [2025-03-03 14:22:22,548 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1989] [2025-03-03 14:22:22,549 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2006] [2025-03-03 14:22:22,549 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [2235] [2025-03-03 14:22:22,549 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2267] [2025-03-03 14:22:22,549 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2633] [2025-03-03 14:22:22,549 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2642] [2025-03-03 14:22:22,549 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2933] [2025-03-03 14:22:22,627 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product25.cil.c[58911,58924] [2025-03-03 14:22:22,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:22:22,672 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:22:22,672 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:22 WrapperNode [2025-03-03 14:22:22,672 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:22:22,673 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:22:22,673 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:22:22,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:22:22,678 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:22" (1/1) ... [2025-03-03 14:22:22,706 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:22" (1/1) ... [2025-03-03 14:22:22,753 INFO L138 Inliner]: procedures = 130, calls = 201, calls flagged for inlining = 59, calls inlined = 56, statements flattened = 1030 [2025-03-03 14:22:22,753 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:22:22,754 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:22:22,754 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:22:22,754 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:22:22,762 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:22" (1/1) ... [2025-03-03 14:22:22,762 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:22" (1/1) ... [2025-03-03 14:22:22,768 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:22" (1/1) ... [2025-03-03 14:22:22,793 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-03 14:22:22,793 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:22" (1/1) ... [2025-03-03 14:22:22,793 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:22" (1/1) ... [2025-03-03 14:22:22,804 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:22" (1/1) ... [2025-03-03 14:22:22,809 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:22" (1/1) ... [2025-03-03 14:22:22,813 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:22" (1/1) ... [2025-03-03 14:22:22,814 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:22" (1/1) ... [2025-03-03 14:22:22,818 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:22:22,820 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:22:22,820 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:22:22,820 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:22:22,822 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:22" (1/1) ... [2025-03-03 14:22:22,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:22:22,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:22,851 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:22:22,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:22:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-03 14:22:22,874 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-03 14:22:22,874 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-03 14:22:22,874 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-03 14:22:22,874 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2025-03-03 14:22:22,874 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2025-03-03 14:22:22,874 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:22:22,874 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:22:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:22:22,875 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:22:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:22:22,875 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:22:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:22:22,875 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:22:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:22:22,875 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:22:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:22:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:22:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:22:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:22:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:22:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:22:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:22:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:22:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:22:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-03 14:22:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-03 14:22:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:22:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:22:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:22:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:22:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:22:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:22:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-03-03 14:22:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-03-03 14:22:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:22:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:22:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:22:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:22:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:22:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:22:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:22:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:22:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:22:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:22:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:22:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:22:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:22:22,878 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:22:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-03 14:22:22,878 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-03 14:22:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:22:22,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:22:23,051 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:22:23,053 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:22:23,159 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1032-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~14#1; [2025-03-03 14:22:23,169 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1896: #res := ~retValue_acc~33; [2025-03-03 14:22:23,182 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1970: #res := ~retValue_acc~35; [2025-03-03 14:22:23,219 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1079-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~15#1; [2025-03-03 14:22:23,219 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1124: #res#1 := ~retValue_acc~16#1; [2025-03-03 14:22:23,243 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1348: #res := ~retValue_acc~19; [2025-03-03 14:22:23,261 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1585-1: createEmail_#res#1 := createEmail_~retValue_acc~24#1; [2025-03-03 14:22:23,276 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L576: #res := ~retValue_acc~8; [2025-03-03 14:22:23,437 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L317-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~4#1; [2025-03-03 14:22:23,437 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1467-1: getClientId_#res#1 := getClientId_~retValue_acc~21#1; [2025-03-03 14:22:23,438 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1633-1: getEmailId_#res#1 := getEmailId_~retValue_acc~26#1; [2025-03-03 14:22:23,438 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1420-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~20#1; [2025-03-03 14:22:23,445 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1933: #res := ~retValue_acc~34; [2025-03-03 14:22:23,469 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1707: #res := ~retValue_acc~28; [2025-03-03 14:22:23,511 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L902: #res := ~retValue_acc~12; [2025-03-03 14:22:23,759 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L283-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~2#1; [2025-03-03 14:22:23,760 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1294-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~18#1; [2025-03-03 14:22:23,760 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2965-1: valid_product_#res#1 := valid_product_~retValue_acc~42#1; [2025-03-03 14:22:23,760 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L274-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~1#1; [2025-03-03 14:22:23,760 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L292-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~3#1; [2025-03-03 14:22:23,760 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1187-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~17#1; [2025-03-03 14:22:23,765 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1670: #res := ~retValue_acc~27; [2025-03-03 14:22:23,767 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1561: #res := ~retValue_acc~22; [2025-03-03 14:22:23,888 INFO L? ?]: Removed 537 outVars from TransFormulas that were not future-live. [2025-03-03 14:22:23,888 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:22:23,900 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:22:23,900 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:22:23,901 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:22:23 BoogieIcfgContainer [2025-03-03 14:22:23,901 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:22:23,903 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:22:23,903 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:22:23,906 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:22:23,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:22:22" (1/3) ... [2025-03-03 14:22:23,906 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e85e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:22:23, skipping insertion in model container [2025-03-03 14:22:23,906 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:22:22" (2/3) ... [2025-03-03 14:22:23,907 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67e85e6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:22:23, skipping insertion in model container [2025-03-03 14:22:23,907 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:22:23" (3/3) ... [2025-03-03 14:22:23,907 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_product25.cil.c [2025-03-03 14:22:23,918 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:22:23,920 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_product25.cil.c that has 24 procedures, 391 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:22:23,982 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:22:23,993 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;@184d8c24, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:22:23,995 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:22:24,001 INFO L276 IsEmpty]: Start isEmpty. Operand has 391 states, 308 states have (on average 1.5584415584415585) internal successors, (480), 311 states have internal predecessors, (480), 58 states have call successors, (58), 23 states have call predecessors, (58), 23 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-03 14:22:24,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:22:24,017 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:24,018 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:24,019 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:24,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:24,022 INFO L85 PathProgramCache]: Analyzing trace with hash -1363662276, now seen corresponding path program 1 times [2025-03-03 14:22:24,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:24,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391632811] [2025-03-03 14:22:24,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:24,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:24,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:22:24,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:22:24,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:24,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:24,649 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:22:24,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:24,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391632811] [2025-03-03 14:22:24,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391632811] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:24,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [144942804] [2025-03-03 14:22:24,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:24,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:24,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:24,652 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:24,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:22:24,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:22:24,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:22:24,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:24,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:24,930 INFO L256 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:22:24,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:24,954 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:22:24,955 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:24,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [144942804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:24,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:24,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:22:24,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150745144] [2025-03-03 14:22:24,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:24,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:22:24,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:24,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:22:24,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:24,980 INFO L87 Difference]: Start difference. First operand has 391 states, 308 states have (on average 1.5584415584415585) internal successors, (480), 311 states have internal predecessors, (480), 58 states have call successors, (58), 23 states have call predecessors, (58), 23 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) Second operand has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 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-03-03 14:22:25,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:25,025 INFO L93 Difference]: Finished difference Result 590 states and 884 transitions. [2025-03-03 14:22:25,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:22:25,027 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 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 117 [2025-03-03 14:22:25,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:25,034 INFO L225 Difference]: With dead ends: 590 [2025-03-03 14:22:25,034 INFO L226 Difference]: Without dead ends: 384 [2025-03-03 14:22:25,038 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:25,039 INFO L435 NwaCegarLoop]: 593 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, 593 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:25,040 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:25,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2025-03-03 14:22:25,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 384. [2025-03-03 14:22:25,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 302 states have (on average 1.5562913907284768) internal successors, (470), 304 states have internal predecessors, (470), 58 states have call successors, (58), 23 states have call predecessors, (58), 23 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-03 14:22:25,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 585 transitions. [2025-03-03 14:22:25,101 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 585 transitions. Word has length 117 [2025-03-03 14:22:25,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:25,102 INFO L471 AbstractCegarLoop]: Abstraction has 384 states and 585 transitions. [2025-03-03 14:22:25,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 34.5) internal successors, (69), 2 states have internal predecessors, (69), 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-03-03 14:22:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 585 transitions. [2025-03-03 14:22:25,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:22:25,108 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:25,108 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:25,115 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:22:25,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:22:25,309 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:25,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:25,310 INFO L85 PathProgramCache]: Analyzing trace with hash -228378513, now seen corresponding path program 1 times [2025-03-03 14:22:25,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:25,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978161531] [2025-03-03 14:22:25,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:25,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:25,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:22:25,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:22:25,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:25,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:25,546 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:22:25,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:25,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978161531] [2025-03-03 14:22:25,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978161531] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:25,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454986909] [2025-03-03 14:22:25,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:25,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:25,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:25,550 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:25,552 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:22:25,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:22:25,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:22:25,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:25,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:25,802 INFO L256 TraceCheckSpWp]: Trace formula consists of 1096 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:22:25,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:25,830 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:22:25,831 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:25,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454986909] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:25,831 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:25,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:22:25,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159432563] [2025-03-03 14:22:25,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:25,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:25,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:25,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:25,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:25,833 INFO L87 Difference]: Start difference. First operand 384 states and 585 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-03-03 14:22:25,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:25,870 INFO L93 Difference]: Finished difference Result 579 states and 862 transitions. [2025-03-03 14:22:25,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:25,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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 118 [2025-03-03 14:22:25,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:25,874 INFO L225 Difference]: With dead ends: 579 [2025-03-03 14:22:25,874 INFO L226 Difference]: Without dead ends: 386 [2025-03-03 14:22:25,875 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:25,875 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 0 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:25,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1166 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:25,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2025-03-03 14:22:25,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 386. [2025-03-03 14:22:25,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 386 states, 304 states have (on average 1.5526315789473684) internal successors, (472), 306 states have internal predecessors, (472), 58 states have call successors, (58), 23 states have call predecessors, (58), 23 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-03-03 14:22:25,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 587 transitions. [2025-03-03 14:22:25,897 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 587 transitions. Word has length 118 [2025-03-03 14:22:25,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:25,897 INFO L471 AbstractCegarLoop]: Abstraction has 386 states and 587 transitions. [2025-03-03 14:22:25,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 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-03-03 14:22:25,898 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 587 transitions. [2025-03-03 14:22:25,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:22:25,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:25,900 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:25,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:26,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:22:26,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:26,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:26,101 INFO L85 PathProgramCache]: Analyzing trace with hash 1387316199, now seen corresponding path program 1 times [2025-03-03 14:22:26,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:26,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349866792] [2025-03-03 14:22:26,101 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:26,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:26,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:22:26,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:22:26,126 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:26,126 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:26,301 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:22:26,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:26,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349866792] [2025-03-03 14:22:26,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349866792] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:26,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54218721] [2025-03-03 14:22:26,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:26,304 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:26,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:26,306 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:26,308 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:22:26,442 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:22:26,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:22:26,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:26,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:26,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:22:26,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:26,573 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:22:26,576 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:26,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54218721] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:26,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:26,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:22:26,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704276808] [2025-03-03 14:22:26,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:26,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:26,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:26,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:26,578 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:26,578 INFO L87 Difference]: Start difference. First operand 386 states and 587 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (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-03-03 14:22:26,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:26,605 INFO L93 Difference]: Finished difference Result 819 states and 1265 transitions. [2025-03-03 14:22:26,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:26,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (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 123 [2025-03-03 14:22:26,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:26,609 INFO L225 Difference]: With dead ends: 819 [2025-03-03 14:22:26,609 INFO L226 Difference]: Without dead ends: 460 [2025-03-03 14:22:26,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:26,610 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 134 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:26,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1134 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:26,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-03-03 14:22:26,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 452. [2025-03-03 14:22:26,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 452 states, 356 states have (on average 1.5730337078651686) internal successors, (560), 358 states have internal predecessors, (560), 72 states have call successors, (72), 23 states have call predecessors, (72), 23 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2025-03-03 14:22:26,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 703 transitions. [2025-03-03 14:22:26,643 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 703 transitions. Word has length 123 [2025-03-03 14:22:26,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:26,644 INFO L471 AbstractCegarLoop]: Abstraction has 452 states and 703 transitions. [2025-03-03 14:22:26,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (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-03-03 14:22:26,645 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 703 transitions. [2025-03-03 14:22:26,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 14:22:26,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:26,648 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:26,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:26,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:26,849 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:26,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:26,849 INFO L85 PathProgramCache]: Analyzing trace with hash -1766714988, now seen corresponding path program 1 times [2025-03-03 14:22:26,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:26,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26122204] [2025-03-03 14:22:26,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:26,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:26,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:22:26,875 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:22:26,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:26,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:27,015 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:22:27,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:27,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26122204] [2025-03-03 14:22:27,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26122204] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:27,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1124497618] [2025-03-03 14:22:27,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:27,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:27,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:27,018 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:27,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:22:27,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:22:27,246 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:22:27,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:27,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:27,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 1113 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:22:27,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:27,296 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:22:27,296 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:27,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1124497618] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:27,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:27,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:22:27,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909249945] [2025-03-03 14:22:27,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:27,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:27,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:27,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:27,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:27,298 INFO L87 Difference]: Start difference. First operand 452 states and 703 transitions. Second operand has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:22:27,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:27,384 INFO L93 Difference]: Finished difference Result 895 states and 1396 transitions. [2025-03-03 14:22:27,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:27,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 124 [2025-03-03 14:22:27,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:27,387 INFO L225 Difference]: With dead ends: 895 [2025-03-03 14:22:27,387 INFO L226 Difference]: Without dead ends: 454 [2025-03-03 14:22:27,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 122 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:27,391 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 2 mSDsluCounter, 1720 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2297 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:27,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2297 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:27,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 454 states. [2025-03-03 14:22:27,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 454 to 454. [2025-03-03 14:22:27,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 357 states have (on average 1.5714285714285714) internal successors, (561), 360 states have internal predecessors, (561), 72 states have call successors, (72), 23 states have call predecessors, (72), 24 states have return successors, (73), 70 states have call predecessors, (73), 71 states have call successors, (73) [2025-03-03 14:22:27,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 706 transitions. [2025-03-03 14:22:27,415 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 706 transitions. Word has length 124 [2025-03-03 14:22:27,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:27,415 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 706 transitions. [2025-03-03 14:22:27,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.0) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:22:27,415 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 706 transitions. [2025-03-03 14:22:27,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 14:22:27,419 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:27,419 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:27,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:27,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:27,620 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:27,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:27,620 INFO L85 PathProgramCache]: Analyzing trace with hash -980135795, now seen corresponding path program 1 times [2025-03-03 14:22:27,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:27,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107604751] [2025-03-03 14:22:27,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:27,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:27,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:22:27,652 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:22:27,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:27,653 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:22:27,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:27,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107604751] [2025-03-03 14:22:27,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107604751] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:27,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354291722] [2025-03-03 14:22:27,779 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:27,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:27,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:27,781 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:27,783 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:22:27,917 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:22:28,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:22:28,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:28,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:28,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 1114 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:22:28,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:28,071 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:22:28,073 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:22:28,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354291722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:28,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:22:28,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:22:28,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923107605] [2025-03-03 14:22:28,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:28,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:28,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:28,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:28,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:22:28,074 INFO L87 Difference]: Start difference. First operand 454 states and 706 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:22:28,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:28,156 INFO L93 Difference]: Finished difference Result 897 states and 1401 transitions. [2025-03-03 14:22:28,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:28,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 125 [2025-03-03 14:22:28,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:28,160 INFO L225 Difference]: With dead ends: 897 [2025-03-03 14:22:28,160 INFO L226 Difference]: Without dead ends: 456 [2025-03-03 14:22:28,161 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:22:28,162 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 2 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2283 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:28,162 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2283 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:28,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-03-03 14:22:28,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2025-03-03 14:22:28,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 358 states have (on average 1.5698324022346368) internal successors, (562), 362 states have internal predecessors, (562), 72 states have call successors, (72), 23 states have call predecessors, (72), 25 states have return successors, (78), 70 states have call predecessors, (78), 71 states have call successors, (78) [2025-03-03 14:22:28,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 712 transitions. [2025-03-03 14:22:28,183 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 712 transitions. Word has length 125 [2025-03-03 14:22:28,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:28,183 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 712 transitions. [2025-03-03 14:22:28,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 5 states have internal predecessors, (86), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:22:28,183 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 712 transitions. [2025-03-03 14:22:28,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 14:22:28,186 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:28,186 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:28,194 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:22:28,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:28,393 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:28,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:28,394 INFO L85 PathProgramCache]: Analyzing trace with hash -356990992, now seen corresponding path program 1 times [2025-03-03 14:22:28,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:28,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324711484] [2025-03-03 14:22:28,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:28,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:28,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 14:22:28,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 14:22:28,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:28,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:28,531 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:22:28,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:28,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324711484] [2025-03-03 14:22:28,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [324711484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:28,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:28,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:28,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894450091] [2025-03-03 14:22:28,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:28,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:28,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:28,533 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:28,533 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:28,533 INFO L87 Difference]: Start difference. First operand 456 states and 712 transitions. Second operand has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:28,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:28,578 INFO L93 Difference]: Finished difference Result 889 states and 1392 transitions. [2025-03-03 14:22:28,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:28,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2025-03-03 14:22:28,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:28,582 INFO L225 Difference]: With dead ends: 889 [2025-03-03 14:22:28,582 INFO L226 Difference]: Without dead ends: 456 [2025-03-03 14:22:28,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:28,587 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 2 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2301 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:28,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2301 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:28,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-03-03 14:22:28,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2025-03-03 14:22:28,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 358 states have (on average 1.5698324022346368) internal successors, (562), 362 states have internal predecessors, (562), 72 states have call successors, (72), 23 states have call predecessors, (72), 25 states have return successors, (77), 70 states have call predecessors, (77), 71 states have call successors, (77) [2025-03-03 14:22:28,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 711 transitions. [2025-03-03 14:22:28,607 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 711 transitions. Word has length 145 [2025-03-03 14:22:28,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:28,607 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 711 transitions. [2025-03-03 14:22:28,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.25) internal successors, (89), 5 states have internal predecessors, (89), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-03-03 14:22:28,607 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 711 transitions. [2025-03-03 14:22:28,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 14:22:28,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:28,609 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:28,610 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:22:28,610 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:28,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:28,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1434876473, now seen corresponding path program 2 times [2025-03-03 14:22:28,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:28,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478085544] [2025-03-03 14:22:28,611 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:22:28,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:28,628 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 146 statements into 2 equivalence classes. [2025-03-03 14:22:28,634 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 66 of 146 statements. [2025-03-03 14:22:28,634 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:22:28,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:28,707 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-03 14:22:28,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:28,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478085544] [2025-03-03 14:22:28,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478085544] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:28,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:28,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:28,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [249254629] [2025-03-03 14:22:28,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:28,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:28,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:28,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:28,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:28,710 INFO L87 Difference]: Start difference. First operand 456 states and 711 transitions. Second operand has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:28,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:28,741 INFO L93 Difference]: Finished difference Result 641 states and 978 transitions. [2025-03-03 14:22:28,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:28,742 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 146 [2025-03-03 14:22:28,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:28,747 INFO L225 Difference]: With dead ends: 641 [2025-03-03 14:22:28,747 INFO L226 Difference]: Without dead ends: 456 [2025-03-03 14:22:28,748 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:28,750 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 0 mSDsluCounter, 1739 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 2321 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-03-03 14:22:28,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 2321 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:28,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2025-03-03 14:22:28,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2025-03-03 14:22:28,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 358 states have (on average 1.5670391061452513) internal successors, (561), 362 states have internal predecessors, (561), 72 states have call successors, (72), 23 states have call predecessors, (72), 25 states have return successors, (77), 70 states have call predecessors, (77), 71 states have call successors, (77) [2025-03-03 14:22:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 710 transitions. [2025-03-03 14:22:28,772 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 710 transitions. Word has length 146 [2025-03-03 14:22:28,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:28,772 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 710 transitions. [2025-03-03 14:22:28,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.2) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (21), 1 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2025-03-03 14:22:28,772 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 710 transitions. [2025-03-03 14:22:28,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 14:22:28,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:28,775 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:28,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:22:28,775 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:28,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:28,775 INFO L85 PathProgramCache]: Analyzing trace with hash -414770469, now seen corresponding path program 1 times [2025-03-03 14:22:28,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:28,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912624869] [2025-03-03 14:22:28,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:28,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:28,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 14:22:28,803 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 14:22:28,804 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:28,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:28,913 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:22:28,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:28,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912624869] [2025-03-03 14:22:28,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [912624869] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:28,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:28,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:22:28,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105073955] [2025-03-03 14:22:28,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:28,915 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:22:28,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:28,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:22:28,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:28,917 INFO L87 Difference]: Start difference. First operand 456 states and 710 transitions. Second operand has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 14:22:28,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:28,979 INFO L93 Difference]: Finished difference Result 891 states and 1393 transitions. [2025-03-03 14:22:28,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:22:28,980 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-03-03 14:22:28,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:28,983 INFO L225 Difference]: With dead ends: 891 [2025-03-03 14:22:28,983 INFO L226 Difference]: Without dead ends: 458 [2025-03-03 14:22:28,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:22:28,985 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 1 mSDsluCounter, 1722 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2300 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:28,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2300 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:28,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2025-03-03 14:22:28,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2025-03-03 14:22:28,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 359 states have (on average 1.565459610027855) internal successors, (562), 364 states have internal predecessors, (562), 72 states have call successors, (72), 23 states have call predecessors, (72), 26 states have return successors, (79), 70 states have call predecessors, (79), 71 states have call successors, (79) [2025-03-03 14:22:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 713 transitions. [2025-03-03 14:22:28,999 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 713 transitions. Word has length 153 [2025-03-03 14:22:28,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:28,999 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 713 transitions. [2025-03-03 14:22:28,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.75) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-03-03 14:22:28,999 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 713 transitions. [2025-03-03 14:22:29,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 14:22:29,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:29,002 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:29,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:22:29,002 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:29,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:29,002 INFO L85 PathProgramCache]: Analyzing trace with hash -893261759, now seen corresponding path program 1 times [2025-03-03 14:22:29,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:29,003 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320928308] [2025-03-03 14:22:29,003 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:29,003 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:29,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 14:22:29,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 14:22:29,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:29,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:29,128 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 14:22:29,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:29,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320928308] [2025-03-03 14:22:29,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320928308] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:29,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:29,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:22:29,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268279125] [2025-03-03 14:22:29,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:29,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:22:29,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:29,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:22:29,130 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:29,131 INFO L87 Difference]: Start difference. First operand 458 states and 713 transitions. Second operand has 8 states, 7 states have (on average 14.142857142857142) internal successors, (99), 8 states have internal predecessors, (99), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-03 14:22:29,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:29,246 INFO L93 Difference]: Finished difference Result 893 states and 1392 transitions. [2025-03-03 14:22:29,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:22:29,247 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.142857142857142) internal successors, (99), 8 states have internal predecessors, (99), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 154 [2025-03-03 14:22:29,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:29,250 INFO L225 Difference]: With dead ends: 893 [2025-03-03 14:22:29,250 INFO L226 Difference]: Without dead ends: 460 [2025-03-03 14:22:29,252 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:22:29,252 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 7 mSDsluCounter, 3379 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3947 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:29,253 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3947 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:29,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2025-03-03 14:22:29,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 460. [2025-03-03 14:22:29,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 361 states have (on average 1.5623268698060941) internal successors, (564), 365 states have internal predecessors, (564), 72 states have call successors, (72), 24 states have call predecessors, (72), 26 states have return successors, (78), 70 states have call predecessors, (78), 71 states have call successors, (78) [2025-03-03 14:22:29,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 714 transitions. [2025-03-03 14:22:29,268 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 714 transitions. Word has length 154 [2025-03-03 14:22:29,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:29,268 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 714 transitions. [2025-03-03 14:22:29,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.142857142857142) internal successors, (99), 8 states have internal predecessors, (99), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-03-03 14:22:29,269 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 714 transitions. [2025-03-03 14:22:29,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 14:22:29,271 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:29,271 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:29,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:22:29,271 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:29,272 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:29,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1335972336, now seen corresponding path program 1 times [2025-03-03 14:22:29,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:29,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973887912] [2025-03-03 14:22:29,272 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:29,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:29,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:22:29,314 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:22:29,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:29,315 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:22:29,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:29,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973887912] [2025-03-03 14:22:29,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973887912] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:29,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:29,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:22:29,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456291343] [2025-03-03 14:22:29,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:29,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:22:29,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:29,437 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:22:29,437 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:22:29,437 INFO L87 Difference]: Start difference. First operand 460 states and 714 transitions. Second operand has 8 states, 7 states have (on average 13.285714285714286) internal successors, (93), 8 states have internal predecessors, (93), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-03 14:22:29,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:29,568 INFO L93 Difference]: Finished difference Result 896 states and 1399 transitions. [2025-03-03 14:22:29,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:22:29,569 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.285714285714286) internal successors, (93), 8 states have internal predecessors, (93), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 136 [2025-03-03 14:22:29,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:29,572 INFO L225 Difference]: With dead ends: 896 [2025-03-03 14:22:29,572 INFO L226 Difference]: Without dead ends: 463 [2025-03-03 14:22:29,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:22:29,574 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 5 mSDsluCounter, 3391 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3961 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:29,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3961 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:29,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-03-03 14:22:29,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2025-03-03 14:22:29,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 363 states have (on average 1.559228650137741) internal successors, (566), 368 states have internal predecessors, (566), 72 states have call successors, (72), 24 states have call predecessors, (72), 27 states have return successors, (83), 70 states have call predecessors, (83), 71 states have call successors, (83) [2025-03-03 14:22:29,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 721 transitions. [2025-03-03 14:22:29,591 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 721 transitions. Word has length 136 [2025-03-03 14:22:29,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:29,592 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 721 transitions. [2025-03-03 14:22:29,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.285714285714286) internal successors, (93), 8 states have internal predecessors, (93), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-03-03 14:22:29,592 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 721 transitions. [2025-03-03 14:22:29,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 14:22:29,594 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:29,594 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:29,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:22:29,595 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:29,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:29,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1686682846, now seen corresponding path program 1 times [2025-03-03 14:22:29,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:29,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869195255] [2025-03-03 14:22:29,595 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:29,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:29,615 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 14:22:29,621 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 14:22:29,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:29,622 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:29,720 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:29,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:29,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869195255] [2025-03-03 14:22:29,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869195255] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:22:29,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [822410119] [2025-03-03 14:22:29,720 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:29,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:29,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:22:29,724 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:22:29,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:22:29,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 14:22:30,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 14:22:30,008 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:30,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:30,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 1217 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:22:30,019 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:22:30,047 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:30,050 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:22:30,144 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:30,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [822410119] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:22:30,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:22:30,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-03 14:22:30,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205936682] [2025-03-03 14:22:30,145 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:22:30,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 14:22:30,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:30,146 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 14:22:30,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:22:30,146 INFO L87 Difference]: Start difference. First operand 463 states and 721 transitions. Second operand has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 14:22:30,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:30,272 INFO L93 Difference]: Finished difference Result 1093 states and 1763 transitions. [2025-03-03 14:22:30,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:22:30,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) Word has length 156 [2025-03-03 14:22:30,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:30,278 INFO L225 Difference]: With dead ends: 1093 [2025-03-03 14:22:30,278 INFO L226 Difference]: Without dead ends: 900 [2025-03-03 14:22:30,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:22:30,280 INFO L435 NwaCegarLoop]: 630 mSDtfsCounter, 517 mSDsluCounter, 1503 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 571 SdHoareTripleChecker+Valid, 2133 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:30,280 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [571 Valid, 2133 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:22:30,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 900 states. [2025-03-03 14:22:30,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 900 to 876. [2025-03-03 14:22:30,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 697 states have (on average 1.6269727403156384) internal successors, (1134), 702 states have internal predecessors, (1134), 151 states have call successors, (151), 24 states have call predecessors, (151), 27 states have return successors, (172), 149 states have call predecessors, (172), 150 states have call successors, (172) [2025-03-03 14:22:30,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 1457 transitions. [2025-03-03 14:22:30,310 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 1457 transitions. Word has length 156 [2025-03-03 14:22:30,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:30,310 INFO L471 AbstractCegarLoop]: Abstraction has 876 states and 1457 transitions. [2025-03-03 14:22:30,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 19.857142857142858) internal successors, (139), 7 states have internal predecessors, (139), 2 states have call successors, (35), 2 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 2 states have call successors, (32) [2025-03-03 14:22:30,311 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 1457 transitions. [2025-03-03 14:22:30,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 14:22:30,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:30,315 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:30,324 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 14:22:30,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:22:30,516 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:30,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:30,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1417636343, now seen corresponding path program 1 times [2025-03-03 14:22:30,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:30,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456840367] [2025-03-03 14:22:30,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:30,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:30,534 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 14:22:30,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 14:22:30,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:30,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:30,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:30,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456840367] [2025-03-03 14:22:30,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456840367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:30,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:30,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:30,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741651698] [2025-03-03 14:22:30,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:30,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:30,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:30,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:30,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:30,573 INFO L87 Difference]: Start difference. First operand 876 states and 1457 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:22:30,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:30,611 INFO L93 Difference]: Finished difference Result 2101 states and 3545 transitions. [2025-03-03 14:22:30,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:30,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 143 [2025-03-03 14:22:30,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:30,621 INFO L225 Difference]: With dead ends: 2101 [2025-03-03 14:22:30,621 INFO L226 Difference]: Without dead ends: 1294 [2025-03-03 14:22:30,625 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:30,626 INFO L435 NwaCegarLoop]: 604 mSDtfsCounter, 132 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 1186 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:30,626 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 1186 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:30,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1294 states. [2025-03-03 14:22:30,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1294 to 1286. [2025-03-03 14:22:30,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1028 states have (on average 1.6429961089494163) internal successors, (1689), 1033 states have internal predecessors, (1689), 230 states have call successors, (230), 24 states have call predecessors, (230), 27 states have return successors, (261), 228 states have call predecessors, (261), 229 states have call successors, (261) [2025-03-03 14:22:30,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 2180 transitions. [2025-03-03 14:22:30,680 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 2180 transitions. Word has length 143 [2025-03-03 14:22:30,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:30,681 INFO L471 AbstractCegarLoop]: Abstraction has 1286 states and 2180 transitions. [2025-03-03 14:22:30,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:22:30,681 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 2180 transitions. [2025-03-03 14:22:30,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-03 14:22:30,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:30,689 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:30,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:22:30,689 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:30,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:30,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1353679202, now seen corresponding path program 1 times [2025-03-03 14:22:30,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:30,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894335321] [2025-03-03 14:22:30,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:30,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:30,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-03 14:22:30,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-03 14:22:30,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:30,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:30,781 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:30,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:30,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894335321] [2025-03-03 14:22:30,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894335321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:30,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:30,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:30,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374852804] [2025-03-03 14:22:30,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:30,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:30,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:30,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:30,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:30,784 INFO L87 Difference]: Start difference. First operand 1286 states and 2180 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:30,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:30,843 INFO L93 Difference]: Finished difference Result 3104 states and 5296 transitions. [2025-03-03 14:22:30,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:30,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 163 [2025-03-03 14:22:30,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:30,856 INFO L225 Difference]: With dead ends: 3104 [2025-03-03 14:22:30,856 INFO L226 Difference]: Without dead ends: 1938 [2025-03-03 14:22:30,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:30,862 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 130 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:30,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 1160 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:30,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1938 states. [2025-03-03 14:22:30,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1938 to 1930. [2025-03-03 14:22:30,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1930 states, 1553 states have (on average 1.6535737282678686) internal successors, (2568), 1558 states have internal predecessors, (2568), 349 states have call successors, (349), 24 states have call predecessors, (349), 27 states have return successors, (380), 347 states have call predecessors, (380), 348 states have call successors, (380) [2025-03-03 14:22:30,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1930 states to 1930 states and 3297 transitions. [2025-03-03 14:22:30,951 INFO L78 Accepts]: Start accepts. Automaton has 1930 states and 3297 transitions. Word has length 163 [2025-03-03 14:22:30,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:30,952 INFO L471 AbstractCegarLoop]: Abstraction has 1930 states and 3297 transitions. [2025-03-03 14:22:30,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:30,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1930 states and 3297 transitions. [2025-03-03 14:22:30,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-03 14:22:30,963 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:30,964 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:30,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:22:30,964 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:30,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:30,964 INFO L85 PathProgramCache]: Analyzing trace with hash 798352648, now seen corresponding path program 1 times [2025-03-03 14:22:30,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:30,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11389978] [2025-03-03 14:22:30,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:30,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:30,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-03 14:22:30,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-03 14:22:30,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:30,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:31,022 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:31,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:31,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11389978] [2025-03-03 14:22:31,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11389978] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:31,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:31,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:31,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388155021] [2025-03-03 14:22:31,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:31,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:31,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:31,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:31,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:31,024 INFO L87 Difference]: Start difference. First operand 1930 states and 3297 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:22:31,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:31,117 INFO L93 Difference]: Finished difference Result 4616 states and 7946 transitions. [2025-03-03 14:22:31,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:31,118 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2025-03-03 14:22:31,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:31,133 INFO L225 Difference]: With dead ends: 4616 [2025-03-03 14:22:31,133 INFO L226 Difference]: Without dead ends: 2928 [2025-03-03 14:22:31,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:31,139 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 128 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:31,140 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1157 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:31,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2025-03-03 14:22:31,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2920. [2025-03-03 14:22:31,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2920 states, 2381 states have (on average 1.6619067618647627) internal successors, (3957), 2386 states have internal predecessors, (3957), 511 states have call successors, (511), 24 states have call predecessors, (511), 27 states have return successors, (558), 509 states have call predecessors, (558), 510 states have call successors, (558) [2025-03-03 14:22:31,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2920 states to 2920 states and 5026 transitions. [2025-03-03 14:22:31,249 INFO L78 Accepts]: Start accepts. Automaton has 2920 states and 5026 transitions. Word has length 145 [2025-03-03 14:22:31,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:31,249 INFO L471 AbstractCegarLoop]: Abstraction has 2920 states and 5026 transitions. [2025-03-03 14:22:31,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:22:31,249 INFO L276 IsEmpty]: Start isEmpty. Operand 2920 states and 5026 transitions. [2025-03-03 14:22:31,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 14:22:31,264 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:31,264 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:31,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:22:31,265 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:31,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:31,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1016337382, now seen corresponding path program 1 times [2025-03-03 14:22:31,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:31,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [448527347] [2025-03-03 14:22:31,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:31,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:31,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 14:22:31,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 14:22:31,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:31,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:31,315 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:31,315 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:31,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [448527347] [2025-03-03 14:22:31,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [448527347] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:31,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:31,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:31,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889513066] [2025-03-03 14:22:31,316 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:31,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:31,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:31,317 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:31,317 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:31,317 INFO L87 Difference]: Start difference. First operand 2920 states and 5026 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:22:31,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:31,463 INFO L93 Difference]: Finished difference Result 7009 states and 12147 transitions. [2025-03-03 14:22:31,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:31,464 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 146 [2025-03-03 14:22:31,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:31,490 INFO L225 Difference]: With dead ends: 7009 [2025-03-03 14:22:31,491 INFO L226 Difference]: Without dead ends: 4531 [2025-03-03 14:22:31,501 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:31,503 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 126 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1157 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:31,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1157 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:31,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2025-03-03 14:22:31,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 4523. [2025-03-03 14:22:31,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4523 states, 3739 states have (on average 1.667825621824017) internal successors, (6236), 3744 states have internal predecessors, (6236), 756 states have call successors, (756), 24 states have call predecessors, (756), 27 states have return successors, (829), 754 states have call predecessors, (829), 755 states have call successors, (829) [2025-03-03 14:22:31,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4523 states to 4523 states and 7821 transitions. [2025-03-03 14:22:31,730 INFO L78 Accepts]: Start accepts. Automaton has 4523 states and 7821 transitions. Word has length 146 [2025-03-03 14:22:31,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:31,730 INFO L471 AbstractCegarLoop]: Abstraction has 4523 states and 7821 transitions. [2025-03-03 14:22:31,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:22:31,731 INFO L276 IsEmpty]: Start isEmpty. Operand 4523 states and 7821 transitions. [2025-03-03 14:22:31,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-03-03 14:22:31,753 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:31,753 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:31,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:22:31,754 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:31,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:31,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1343962560, now seen corresponding path program 1 times [2025-03-03 14:22:31,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:31,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1697030014] [2025-03-03 14:22:31,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:31,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:31,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-03-03 14:22:31,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-03-03 14:22:31,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:31,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:31,813 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:31,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:31,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1697030014] [2025-03-03 14:22:31,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1697030014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:31,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:31,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:31,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750308981] [2025-03-03 14:22:31,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:31,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:31,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:31,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:31,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:31,816 INFO L87 Difference]: Start difference. First operand 4523 states and 7821 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:31,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:31,974 INFO L93 Difference]: Finished difference Result 10999 states and 19151 transitions. [2025-03-03 14:22:31,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:31,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 166 [2025-03-03 14:22:31,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:32,018 INFO L225 Difference]: With dead ends: 10999 [2025-03-03 14:22:32,019 INFO L226 Difference]: Without dead ends: 7225 [2025-03-03 14:22:32,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:32,033 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 124 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:32,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1166 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:32,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7225 states. [2025-03-03 14:22:32,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7225 to 7217. [2025-03-03 14:22:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7217 states, 5940 states have (on average 1.667003367003367) internal successors, (9902), 5945 states have internal predecessors, (9902), 1249 states have call successors, (1249), 24 states have call predecessors, (1249), 27 states have return successors, (1366), 1247 states have call predecessors, (1366), 1248 states have call successors, (1366) [2025-03-03 14:22:32,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7217 states to 7217 states and 12517 transitions. [2025-03-03 14:22:32,347 INFO L78 Accepts]: Start accepts. Automaton has 7217 states and 12517 transitions. Word has length 166 [2025-03-03 14:22:32,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:32,347 INFO L471 AbstractCegarLoop]: Abstraction has 7217 states and 12517 transitions. [2025-03-03 14:22:32,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:32,348 INFO L276 IsEmpty]: Start isEmpty. Operand 7217 states and 12517 transitions. [2025-03-03 14:22:32,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-03-03 14:22:32,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:32,375 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:32,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:22:32,375 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:32,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:32,376 INFO L85 PathProgramCache]: Analyzing trace with hash 737401568, now seen corresponding path program 1 times [2025-03-03 14:22:32,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:32,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426561285] [2025-03-03 14:22:32,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:32,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:32,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-03-03 14:22:32,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-03-03 14:22:32,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:32,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:32,435 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:32,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:32,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426561285] [2025-03-03 14:22:32,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426561285] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:32,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:32,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:32,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862876368] [2025-03-03 14:22:32,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:32,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:32,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:32,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:32,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:32,437 INFO L87 Difference]: Start difference. First operand 7217 states and 12517 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:32,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:32,688 INFO L93 Difference]: Finished difference Result 18229 states and 31819 transitions. [2025-03-03 14:22:32,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:32,689 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 167 [2025-03-03 14:22:32,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:32,736 INFO L225 Difference]: With dead ends: 18229 [2025-03-03 14:22:32,736 INFO L226 Difference]: Without dead ends: 12132 [2025-03-03 14:22:32,761 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:32,762 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 122 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:32,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1162 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:32,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12132 states. [2025-03-03 14:22:33,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12132 to 12124. [2025-03-03 14:22:33,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12124 states, 10025 states have (on average 1.6678304239401496) internal successors, (16720), 10030 states have internal predecessors, (16720), 2071 states have call successors, (2071), 24 states have call predecessors, (2071), 27 states have return successors, (2266), 2069 states have call predecessors, (2266), 2070 states have call successors, (2266) [2025-03-03 14:22:33,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12124 states to 12124 states and 21057 transitions. [2025-03-03 14:22:33,312 INFO L78 Accepts]: Start accepts. Automaton has 12124 states and 21057 transitions. Word has length 167 [2025-03-03 14:22:33,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:33,313 INFO L471 AbstractCegarLoop]: Abstraction has 12124 states and 21057 transitions. [2025-03-03 14:22:33,313 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:33,313 INFO L276 IsEmpty]: Start isEmpty. Operand 12124 states and 21057 transitions. [2025-03-03 14:22:33,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2025-03-03 14:22:33,355 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:33,355 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:33,356 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:22:33,356 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:33,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:33,356 INFO L85 PathProgramCache]: Analyzing trace with hash -985357919, now seen corresponding path program 1 times [2025-03-03 14:22:33,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:33,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441333304] [2025-03-03 14:22:33,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:33,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:33,377 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 168 statements into 1 equivalence classes. [2025-03-03 14:22:33,384 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 168 of 168 statements. [2025-03-03 14:22:33,384 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:33,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:33,423 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:33,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:33,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441333304] [2025-03-03 14:22:33,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441333304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:33,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:33,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:33,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342671631] [2025-03-03 14:22:33,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:33,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:33,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:33,425 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:33,425 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:33,425 INFO L87 Difference]: Start difference. First operand 12124 states and 21057 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:33,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:33,879 INFO L93 Difference]: Finished difference Result 28985 states and 50301 transitions. [2025-03-03 14:22:33,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:33,879 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 168 [2025-03-03 14:22:33,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:33,957 INFO L225 Difference]: With dead ends: 28985 [2025-03-03 14:22:33,957 INFO L226 Difference]: Without dead ends: 18948 [2025-03-03 14:22:33,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:33,997 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 120 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:33,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1134 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:34,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18948 states. [2025-03-03 14:22:34,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18948 to 18940. [2025-03-03 14:22:34,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18940 states, 15638 states have (on average 1.64503133393017) internal successors, (25725), 15643 states have internal predecessors, (25725), 3274 states have call successors, (3274), 24 states have call predecessors, (3274), 27 states have return successors, (3613), 3272 states have call predecessors, (3613), 3273 states have call successors, (3613) [2025-03-03 14:22:34,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18940 states to 18940 states and 32612 transitions. [2025-03-03 14:22:34,690 INFO L78 Accepts]: Start accepts. Automaton has 18940 states and 32612 transitions. Word has length 168 [2025-03-03 14:22:34,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:34,691 INFO L471 AbstractCegarLoop]: Abstraction has 18940 states and 32612 transitions. [2025-03-03 14:22:34,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:34,691 INFO L276 IsEmpty]: Start isEmpty. Operand 18940 states and 32612 transitions. [2025-03-03 14:22:34,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-03-03 14:22:34,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:34,733 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:34,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:22:34,733 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:34,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:34,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1806555873, now seen corresponding path program 1 times [2025-03-03 14:22:34,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:34,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464606558] [2025-03-03 14:22:34,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:34,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:34,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-03-03 14:22:34,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-03-03 14:22:34,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:34,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:34,791 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:34,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:34,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464606558] [2025-03-03 14:22:34,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464606558] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:34,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:34,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:34,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982091254] [2025-03-03 14:22:34,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:34,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:34,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:34,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:34,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:34,793 INFO L87 Difference]: Start difference. First operand 18940 states and 32612 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:35,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:35,526 INFO L93 Difference]: Finished difference Result 50022 states and 86486 transitions. [2025-03-03 14:22:35,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:35,527 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 169 [2025-03-03 14:22:35,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:35,680 INFO L225 Difference]: With dead ends: 50022 [2025-03-03 14:22:35,680 INFO L226 Difference]: Without dead ends: 33803 [2025-03-03 14:22:35,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:35,736 INFO L435 NwaCegarLoop]: 583 mSDtfsCounter, 118 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1160 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:35,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1160 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:35,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33803 states. [2025-03-03 14:22:36,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33803 to 33795. [2025-03-03 14:22:37,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33795 states, 28043 states have (on average 1.6425489426951467) internal successors, (46062), 28048 states have internal predecessors, (46062), 5724 states have call successors, (5724), 24 states have call predecessors, (5724), 27 states have return successors, (6337), 5722 states have call predecessors, (6337), 5723 states have call successors, (6337) [2025-03-03 14:22:37,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33795 states to 33795 states and 58123 transitions. [2025-03-03 14:22:37,163 INFO L78 Accepts]: Start accepts. Automaton has 33795 states and 58123 transitions. Word has length 169 [2025-03-03 14:22:37,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:37,164 INFO L471 AbstractCegarLoop]: Abstraction has 33795 states and 58123 transitions. [2025-03-03 14:22:37,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:37,164 INFO L276 IsEmpty]: Start isEmpty. Operand 33795 states and 58123 transitions. [2025-03-03 14:22:37,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-03 14:22:37,213 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:37,213 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:37,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:22:37,214 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:37,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:37,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1457491771, now seen corresponding path program 1 times [2025-03-03 14:22:37,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:37,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351192645] [2025-03-03 14:22:37,215 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:37,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:37,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-03 14:22:37,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-03 14:22:37,239 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:37,239 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:37,269 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:37,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:37,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351192645] [2025-03-03 14:22:37,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351192645] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:37,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:37,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:37,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223405364] [2025-03-03 14:22:37,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:37,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:37,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:37,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:37,271 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:37,271 INFO L87 Difference]: Start difference. First operand 33795 states and 58123 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:22:38,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:38,270 INFO L93 Difference]: Finished difference Result 92114 states and 158968 transitions. [2025-03-03 14:22:38,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:38,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 151 [2025-03-03 14:22:38,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:38,552 INFO L225 Difference]: With dead ends: 92114 [2025-03-03 14:22:38,553 INFO L226 Difference]: Without dead ends: 61947 [2025-03-03 14:22:38,640 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:38,642 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 116 mSDsluCounter, 577 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:38,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1161 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:38,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61947 states. [2025-03-03 14:22:40,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61947 to 61939. [2025-03-03 14:22:40,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61939 states, 51674 states have (on average 1.6389286681890312) internal successors, (84690), 51679 states have internal predecessors, (84690), 10237 states have call successors, (10237), 24 states have call predecessors, (10237), 27 states have return successors, (11382), 10235 states have call predecessors, (11382), 10236 states have call successors, (11382) [2025-03-03 14:22:40,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61939 states to 61939 states and 106309 transitions. [2025-03-03 14:22:41,024 INFO L78 Accepts]: Start accepts. Automaton has 61939 states and 106309 transitions. Word has length 151 [2025-03-03 14:22:41,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:41,024 INFO L471 AbstractCegarLoop]: Abstraction has 61939 states and 106309 transitions. [2025-03-03 14:22:41,024 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:22:41,025 INFO L276 IsEmpty]: Start isEmpty. Operand 61939 states and 106309 transitions. [2025-03-03 14:22:41,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-03-03 14:22:41,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:41,104 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:41,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:22:41,104 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:41,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:41,105 INFO L85 PathProgramCache]: Analyzing trace with hash -2026450242, now seen corresponding path program 1 times [2025-03-03 14:22:41,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:41,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210863329] [2025-03-03 14:22:41,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:41,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:41,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-03-03 14:22:41,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-03-03 14:22:41,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:41,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:41,173 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:22:41,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:41,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210863329] [2025-03-03 14:22:41,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210863329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:41,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:41,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:22:41,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675435039] [2025-03-03 14:22:41,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:41,175 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:22:41,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:41,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:22:41,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:41,175 INFO L87 Difference]: Start difference. First operand 61939 states and 106309 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:43,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:43,004 INFO L93 Difference]: Finished difference Result 115980 states and 199523 transitions. [2025-03-03 14:22:43,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:22:43,004 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 171 [2025-03-03 14:22:43,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:43,543 INFO L225 Difference]: With dead ends: 115980 [2025-03-03 14:22:43,544 INFO L226 Difference]: Without dead ends: 115787 [2025-03-03 14:22:43,620 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:22:43,621 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 111 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1174 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:43,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1174 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:22:43,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115787 states. [2025-03-03 14:22:47,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115787 to 115779. [2025-03-03 14:22:47,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115779 states, 97146 states have (on average 1.6341177197208325) internal successors, (158748), 97151 states have internal predecessors, (158748), 18605 states have call successors, (18605), 24 states have call predecessors, (18605), 27 states have return successors, (20796), 18603 states have call predecessors, (20796), 18604 states have call successors, (20796) [2025-03-03 14:22:47,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115779 states to 115779 states and 198149 transitions. [2025-03-03 14:22:47,875 INFO L78 Accepts]: Start accepts. Automaton has 115779 states and 198149 transitions. Word has length 171 [2025-03-03 14:22:47,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:47,875 INFO L471 AbstractCegarLoop]: Abstraction has 115779 states and 198149 transitions. [2025-03-03 14:22:47,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-03-03 14:22:47,876 INFO L276 IsEmpty]: Start isEmpty. Operand 115779 states and 198149 transitions. [2025-03-03 14:22:47,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 14:22:47,970 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:47,970 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:47,970 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:22:47,970 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:47,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:47,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1810558492, now seen corresponding path program 1 times [2025-03-03 14:22:47,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:47,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116992947] [2025-03-03 14:22:47,971 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:47,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:47,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 14:22:48,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 14:22:48,004 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:48,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:48,170 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:48,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:48,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116992947] [2025-03-03 14:22:48,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116992947] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:48,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:48,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:22:48,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637713105] [2025-03-03 14:22:48,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:48,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:22:48,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:48,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:22:48,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:22:48,172 INFO L87 Difference]: Start difference. First operand 115779 states and 198149 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:22:50,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:22:50,647 INFO L93 Difference]: Finished difference Result 116155 states and 198690 transitions. [2025-03-03 14:22:50,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:22:50,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) Word has length 153 [2025-03-03 14:22:50,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:22:51,185 INFO L225 Difference]: With dead ends: 116155 [2025-03-03 14:22:51,185 INFO L226 Difference]: Without dead ends: 115970 [2025-03-03 14:22:51,241 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:22:51,242 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 512 mSDsluCounter, 1996 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 514 SdHoareTripleChecker+Valid, 2616 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-03 14:22:51,243 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [514 Valid, 2616 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-03 14:22:51,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115970 states. [2025-03-03 14:22:54,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115970 to 115966. [2025-03-03 14:22:54,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115966 states, 97291 states have (on average 1.6338407458038255) internal successors, (158958), 97297 states have internal predecessors, (158958), 18632 states have call successors, (18632), 37 states have call predecessors, (18632), 42 states have return successors, (20828), 18631 states have call predecessors, (20828), 18629 states have call successors, (20828) [2025-03-03 14:22:55,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115966 states to 115966 states and 198418 transitions. [2025-03-03 14:22:55,198 INFO L78 Accepts]: Start accepts. Automaton has 115966 states and 198418 transitions. Word has length 153 [2025-03-03 14:22:55,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:22:55,199 INFO L471 AbstractCegarLoop]: Abstraction has 115966 states and 198418 transitions. [2025-03-03 14:22:55,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 5 states have internal predecessors, (105), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 3 states have call predecessors, (16), 2 states have call successors, (16) [2025-03-03 14:22:55,199 INFO L276 IsEmpty]: Start isEmpty. Operand 115966 states and 198418 transitions. [2025-03-03 14:22:55,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 14:22:55,279 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:22:55,280 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:22:55,280 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:22:55,280 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:22:55,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:22:55,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1177035559, now seen corresponding path program 1 times [2025-03-03 14:22:55,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:22:55,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373796813] [2025-03-03 14:22:55,280 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:22:55,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:22:55,293 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 14:22:55,302 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 14:22:55,302 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:22:55,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:22:55,637 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:22:55,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:22:55,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373796813] [2025-03-03 14:22:55,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373796813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:22:55,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:22:55,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-03-03 14:22:55,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420033095] [2025-03-03 14:22:55,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:22:55,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 14:22:55,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:22:55,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 14:22:55,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2025-03-03 14:22:55,639 INFO L87 Difference]: Start difference. First operand 115966 states and 198418 transitions. Second operand has 15 states, 13 states have (on average 8.153846153846153) internal successors, (106), 13 states have internal predecessors, (106), 9 states have call successors, (19), 3 states have call predecessors, (19), 2 states have return successors, (16), 7 states have call predecessors, (16), 8 states have call successors, (16)