./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec4_product17.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec4_product17.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 922981a69371fe79bea26dd37077d7dd588a5af1cfad53b27080b4988960097d --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:53:57,386 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:53:57,426 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:53:57,430 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:53:57,430 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:53:57,445 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:53:57,446 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:53:57,446 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:53:57,446 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:53:57,446 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:53:57,446 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:53:57,446 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:53:57,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:53:57,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:53:57,447 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:53:57,447 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:53:57,447 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:53:57,447 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:53:57,447 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:53:57,447 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:53:57,447 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:53:57,447 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:53:57,447 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:53:57,447 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:53:57,447 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:53:57,447 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:53:57,447 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:53:57,447 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:53:57,447 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:53:57,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:53:57,447 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:53:57,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:53:57,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:53:57,448 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:53:57,448 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:53:57,448 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:53:57,448 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:53:57,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:53:57,448 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:53:57,448 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:53:57,448 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:53:57,448 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:53:57,448 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:53:57,448 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:53:57,448 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:53:57,448 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:53:57,448 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:53:57,448 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:53:57,448 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 922981a69371fe79bea26dd37077d7dd588a5af1cfad53b27080b4988960097d [2025-01-09 03:53:57,679 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:53:57,685 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:53:57,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:53:57,687 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:53:57,687 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:53:57,688 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec4_product17.cil.c [2025-01-09 03:53:58,936 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0d0f5c3e/6d763fd0833d442a9a8db65bc8e6826f/FLAGca836f68c [2025-01-09 03:53:59,320 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:53:59,321 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product17.cil.c [2025-01-09 03:53:59,340 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0d0f5c3e/6d763fd0833d442a9a8db65bc8e6826f/FLAGca836f68c [2025-01-09 03:53:59,354 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c0d0f5c3e/6d763fd0833d442a9a8db65bc8e6826f [2025-01-09 03:53:59,356 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:53:59,358 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:53:59,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:53:59,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:53:59,363 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:53:59,363 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:53:59" (1/1) ... [2025-01-09 03:53:59,364 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30c7e046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:59, skipping insertion in model container [2025-01-09 03:53:59,364 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:53:59" (1/1) ... [2025-01-09 03:53:59,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:53:59,752 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product17.cil.c[45969,45982] [2025-01-09 03:53:59,833 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:53:59,845 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:53:59,851 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [48] [2025-01-09 03:53:59,852 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [90] [2025-01-09 03:53:59,853 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1169] [2025-01-09 03:53:59,853 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1467] [2025-01-09 03:53:59,853 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1774] [2025-01-09 03:53:59,853 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1809] [2025-01-09 03:53:59,853 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2212] [2025-01-09 03:53:59,853 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2229] [2025-01-09 03:53:59,853 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2238] [2025-01-09 03:53:59,854 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2335] [2025-01-09 03:53:59,854 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2551] [2025-01-09 03:53:59,922 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product17.cil.c[45969,45982] [2025-01-09 03:53:59,941 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:53:59,961 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:53:59,965 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:59 WrapperNode [2025-01-09 03:53:59,965 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:53:59,966 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:53:59,966 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:53:59,966 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:53:59,971 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:59" (1/1) ... [2025-01-09 03:53:59,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:59" (1/1) ... [2025-01-09 03:54:00,027 INFO L138 Inliner]: procedures = 127, calls = 192, calls flagged for inlining = 53, calls inlined = 46, statements flattened = 904 [2025-01-09 03:54:00,027 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:54:00,028 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:54:00,028 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:54:00,028 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:54:00,043 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:59" (1/1) ... [2025-01-09 03:54:00,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:59" (1/1) ... [2025-01-09 03:54:00,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:59" (1/1) ... [2025-01-09 03:54:00,065 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-01-09 03:54:00,065 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:59" (1/1) ... [2025-01-09 03:54:00,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:59" (1/1) ... [2025-01-09 03:54:00,074 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:59" (1/1) ... [2025-01-09 03:54:00,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:59" (1/1) ... [2025-01-09 03:54:00,080 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:59" (1/1) ... [2025-01-09 03:54:00,083 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:59" (1/1) ... [2025-01-09 03:54:00,084 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:59" (1/1) ... [2025-01-09 03:54:00,092 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:54:00,093 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:54:00,093 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:54:00,093 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:54:00,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:59" (1/1) ... [2025-01-09 03:54:00,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:54:00,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:00,143 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:54:00,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:54:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:54:00,187 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:54:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-01-09 03:54:00,187 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-01-09 03:54:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-01-09 03:54:00,187 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-01-09 03:54:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2025-01-09 03:54:00,187 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2025-01-09 03:54:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:54:00,187 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:54:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:54:00,187 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:54:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:54:00,187 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:54:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:54:00,187 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:54:00,187 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:54:00,188 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:54:00,188 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:54:00,188 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:54:00,188 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:54:00,189 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:54:00,189 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:54:00,189 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:54:00,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:54:00,189 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:54:00,189 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:54:00,189 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-01-09 03:54:00,189 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-01-09 03:54:00,189 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:54:00,189 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:54:00,189 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:54:00,189 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:54:00,189 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:54:00,189 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:54:00,189 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:54:00,189 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:54:00,189 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:54:00,189 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:54:00,189 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:54:00,189 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:54:00,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:54:00,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:54:00,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:54:00,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:54:00,189 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:54:00,189 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:54:00,190 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-01-09 03:54:00,190 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-01-09 03:54:00,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:54:00,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:54:00,358 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:54:00,361 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:54:01,010 INFO L? ?]: Removed 467 outVars from TransFormulas that were not future-live. [2025-01-09 03:54:01,012 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:54:01,033 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:54:01,033 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:54:01,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:54:01 BoogieIcfgContainer [2025-01-09 03:54:01,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:54:01,035 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:54:01,036 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:54:01,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:54:01,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:53:59" (1/3) ... [2025-01-09 03:54:01,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce8acb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:54:01, skipping insertion in model container [2025-01-09 03:54:01,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:53:59" (2/3) ... [2025-01-09 03:54:01,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ce8acb0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:54:01, skipping insertion in model container [2025-01-09 03:54:01,041 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:54:01" (3/3) ... [2025-01-09 03:54:01,042 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec4_product17.cil.c [2025-01-09 03:54:01,053 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:54:01,057 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec4_product17.cil.c that has 23 procedures, 351 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:54:01,138 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:54:01,146 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;@64eb57d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:54:01,146 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:54:01,150 INFO L276 IsEmpty]: Start isEmpty. Operand has 351 states, 277 states have (on average 1.5812274368231047) internal successors, (438), 280 states have internal predecessors, (438), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) [2025-01-09 03:54:01,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 03:54:01,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:01,160 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:01,161 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:01,164 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:01,164 INFO L85 PathProgramCache]: Analyzing trace with hash -238255293, now seen corresponding path program 1 times [2025-01-09 03:54:01,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:01,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597987470] [2025-01-09 03:54:01,170 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:01,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:01,250 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:54:01,294 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:54:01,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:01,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:01,689 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:54:01,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:01,689 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597987470] [2025-01-09 03:54:01,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597987470] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:01,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029793838] [2025-01-09 03:54:01,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:01,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:01,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:01,693 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:54:01,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:54:01,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:54:01,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:54:01,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:01,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:01,938 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 03:54:01,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:01,954 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:54:01,954 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:01,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029793838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:01,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:01,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-01-09 03:54:01,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085391680] [2025-01-09 03:54:01,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:01,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:54:01,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:01,975 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:54:01,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:54:01,979 INFO L87 Difference]: Start difference. First operand has 351 states, 277 states have (on average 1.5812274368231047) internal successors, (438), 280 states have internal predecessors, (438), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (50), 49 states have call predecessors, (50), 50 states have call successors, (50) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:02,021 INFO L93 Difference]: Finished difference Result 515 states and 776 transitions. [2025-01-09 03:54:02,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:54:02,022 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 101 [2025-01-09 03:54:02,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:02,029 INFO L225 Difference]: With dead ends: 515 [2025-01-09 03:54:02,029 INFO L226 Difference]: Without dead ends: 344 [2025-01-09 03:54:02,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:54:02,034 INFO L435 NwaCegarLoop]: 535 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, 535 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:02,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:02,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2025-01-09 03:54:02,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 344. [2025-01-09 03:54:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 271 states have (on average 1.5793357933579335) internal successors, (428), 273 states have internal predecessors, (428), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 03:54:02,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 527 transitions. [2025-01-09 03:54:02,072 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 527 transitions. Word has length 101 [2025-01-09 03:54:02,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:02,072 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 527 transitions. [2025-01-09 03:54:02,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:02,073 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 527 transitions. [2025-01-09 03:54:02,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 03:54:02,077 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:02,077 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:02,086 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:54:02,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 03:54:02,278 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:02,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:02,278 INFO L85 PathProgramCache]: Analyzing trace with hash 343431377, now seen corresponding path program 1 times [2025-01-09 03:54:02,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:02,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058588963] [2025-01-09 03:54:02,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:02,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:02,301 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:54:02,309 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:54:02,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:02,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:02,456 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:54:02,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:02,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058588963] [2025-01-09 03:54:02,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058588963] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:02,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790943477] [2025-01-09 03:54:02,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:02,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:02,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:02,459 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:54:02,468 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:54:02,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:54:02,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:54:02,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:02,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:02,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 951 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:54:02,699 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:02,737 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:54:02,737 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:02,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790943477] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:02,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:02,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:54:02,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950720111] [2025-01-09 03:54:02,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:02,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:02,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:02,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:02,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:54:02,739 INFO L87 Difference]: Start difference. First operand 344 states and 527 transitions. Second operand has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:02,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:02,774 INFO L93 Difference]: Finished difference Result 504 states and 754 transitions. [2025-01-09 03:54:02,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:02,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 101 [2025-01-09 03:54:02,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:02,778 INFO L225 Difference]: With dead ends: 504 [2025-01-09 03:54:02,778 INFO L226 Difference]: Without dead ends: 346 [2025-01-09 03:54:02,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:54:02,780 INFO L435 NwaCegarLoop]: 525 mSDtfsCounter, 1 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:02,780 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1048 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:02,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2025-01-09 03:54:02,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 345. [2025-01-09 03:54:02,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 272 states have (on average 1.5772058823529411) internal successors, (429), 274 states have internal predecessors, (429), 50 states have call successors, (50), 22 states have call predecessors, (50), 22 states have return successors, (49), 48 states have call predecessors, (49), 49 states have call successors, (49) [2025-01-09 03:54:02,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 528 transitions. [2025-01-09 03:54:02,795 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 528 transitions. Word has length 101 [2025-01-09 03:54:02,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:02,795 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 528 transitions. [2025-01-09 03:54:02,795 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.0) internal successors, (54), 3 states have internal predecessors, (54), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:02,795 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 528 transitions. [2025-01-09 03:54:02,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 03:54:02,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:02,798 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:02,806 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:54:02,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:02,999 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:03,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:03,000 INFO L85 PathProgramCache]: Analyzing trace with hash 776237292, now seen corresponding path program 1 times [2025-01-09 03:54:03,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:03,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186869285] [2025-01-09 03:54:03,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:03,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:03,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:54:03,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:54:03,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:03,048 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:03,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186869285] [2025-01-09 03:54:03,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186869285] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:03,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818898137] [2025-01-09 03:54:03,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:03,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:03,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:03,253 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:54:03,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:54:03,379 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:54:03,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:54:03,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:03,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:03,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 962 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:54:03,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:03,484 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:54:03,484 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:03,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818898137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:03,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:03,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:54:03,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814751744] [2025-01-09 03:54:03,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:03,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:03,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:03,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:03,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:54:03,486 INFO L87 Difference]: Start difference. First operand 345 states and 528 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:03,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:03,512 INFO L93 Difference]: Finished difference Result 733 states and 1140 transitions. [2025-01-09 03:54:03,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:03,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 106 [2025-01-09 03:54:03,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:03,516 INFO L225 Difference]: With dead ends: 733 [2025-01-09 03:54:03,516 INFO L226 Difference]: Without dead ends: 414 [2025-01-09 03:54:03,517 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:54:03,517 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 126 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 1023 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:03,518 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [144 Valid, 1023 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:03,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2025-01-09 03:54:03,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 406. [2025-01-09 03:54:03,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 319 states have (on average 1.5956112852664577) internal successors, (509), 321 states have internal predecessors, (509), 64 states have call successors, (64), 22 states have call predecessors, (64), 22 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2025-01-09 03:54:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 636 transitions. [2025-01-09 03:54:03,581 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 636 transitions. Word has length 106 [2025-01-09 03:54:03,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:03,581 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 636 transitions. [2025-01-09 03:54:03,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:03,581 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 636 transitions. [2025-01-09 03:54:03,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:54:03,584 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:03,588 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:03,599 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:54:03,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:03,790 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:03,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:03,793 INFO L85 PathProgramCache]: Analyzing trace with hash 470531170, now seen corresponding path program 1 times [2025-01-09 03:54:03,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:03,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251789675] [2025-01-09 03:54:03,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:03,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:03,808 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:54:03,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:54:03,814 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:03,814 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:03,932 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:03,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:03,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251789675] [2025-01-09 03:54:03,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251789675] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:03,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560353712] [2025-01-09 03:54:03,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:03,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:03,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:03,935 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:54:03,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:54:04,151 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:54:04,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:54:04,240 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:04,240 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:04,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 967 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:54:04,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:04,296 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 03:54:04,298 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:04,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560353712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:04,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:04,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:54:04,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143883737] [2025-01-09 03:54:04,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:04,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:04,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:04,300 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:04,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:04,301 INFO L87 Difference]: Start difference. First operand 406 states and 636 transitions. Second operand has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:54:04,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:04,398 INFO L93 Difference]: Finished difference Result 803 states and 1262 transitions. [2025-01-09 03:54:04,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:04,403 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 107 [2025-01-09 03:54:04,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:04,405 INFO L225 Difference]: With dead ends: 803 [2025-01-09 03:54:04,406 INFO L226 Difference]: Without dead ends: 408 [2025-01-09 03:54:04,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:04,407 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 2 mSDsluCounter, 1546 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2065 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:04,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2065 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:04,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-01-09 03:54:04,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 408. [2025-01-09 03:54:04,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 408 states, 320 states have (on average 1.59375) internal successors, (510), 323 states have internal predecessors, (510), 64 states have call successors, (64), 22 states have call predecessors, (64), 23 states have return successors, (65), 62 states have call predecessors, (65), 63 states have call successors, (65) [2025-01-09 03:54:04,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 639 transitions. [2025-01-09 03:54:04,427 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 639 transitions. Word has length 107 [2025-01-09 03:54:04,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:04,429 INFO L471 AbstractCegarLoop]: Abstraction has 408 states and 639 transitions. [2025-01-09 03:54:04,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.25) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:54:04,429 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 639 transitions. [2025-01-09 03:54:04,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 03:54:04,432 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:04,432 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:04,440 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:54:04,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:04,634 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:04,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:04,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1875596624, now seen corresponding path program 1 times [2025-01-09 03:54:04,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:04,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111230493] [2025-01-09 03:54:04,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:04,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:04,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:54:04,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:54:04,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:04,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:04,765 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:54:04,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:04,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111230493] [2025-01-09 03:54:04,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111230493] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:04,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265909395] [2025-01-09 03:54:04,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:04,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:04,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:04,771 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:54:04,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:54:04,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:54:04,979 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:54:04,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:04,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:04,984 INFO L256 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:54:04,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:05,031 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 03:54:05,031 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:05,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265909395] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:05,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:05,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:54:05,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102958465] [2025-01-09 03:54:05,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:05,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:05,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:05,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:05,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:54:05,033 INFO L87 Difference]: Start difference. First operand 408 states and 639 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:54:05,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:05,098 INFO L93 Difference]: Finished difference Result 805 states and 1267 transitions. [2025-01-09 03:54:05,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:05,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 108 [2025-01-09 03:54:05,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:05,101 INFO L225 Difference]: With dead ends: 805 [2025-01-09 03:54:05,103 INFO L226 Difference]: Without dead ends: 410 [2025-01-09 03:54:05,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:54:05,105 INFO L435 NwaCegarLoop]: 517 mSDtfsCounter, 2 mSDsluCounter, 1534 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2051 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:05,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2051 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:05,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-01-09 03:54:05,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2025-01-09 03:54:05,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 321 states have (on average 1.5919003115264798) internal successors, (511), 325 states have internal predecessors, (511), 64 states have call successors, (64), 22 states have call predecessors, (64), 24 states have return successors, (70), 62 states have call predecessors, (70), 63 states have call successors, (70) [2025-01-09 03:54:05,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 645 transitions. [2025-01-09 03:54:05,161 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 645 transitions. Word has length 108 [2025-01-09 03:54:05,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:05,161 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 645 transitions. [2025-01-09 03:54:05,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:54:05,161 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 645 transitions. [2025-01-09 03:54:05,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:54:05,170 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:05,170 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:05,183 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 03:54:05,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:05,371 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:05,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:05,372 INFO L85 PathProgramCache]: Analyzing trace with hash -253448459, now seen corresponding path program 1 times [2025-01-09 03:54:05,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:05,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406338052] [2025-01-09 03:54:05,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:05,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:05,400 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:54:05,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:54:05,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:05,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:05,527 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:05,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:05,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406338052] [2025-01-09 03:54:05,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406338052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:05,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:05,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:54:05,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460077985] [2025-01-09 03:54:05,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:05,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:05,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:05,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:05,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:54:05,529 INFO L87 Difference]: Start difference. First operand 410 states and 645 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:54:05,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:05,568 INFO L93 Difference]: Finished difference Result 797 states and 1258 transitions. [2025-01-09 03:54:05,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:05,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 109 [2025-01-09 03:54:05,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:05,571 INFO L225 Difference]: With dead ends: 797 [2025-01-09 03:54:05,572 INFO L226 Difference]: Without dead ends: 410 [2025-01-09 03:54:05,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:54:05,573 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 2 mSDsluCounter, 1549 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2069 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:05,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2069 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:05,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-01-09 03:54:05,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2025-01-09 03:54:05,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 321 states have (on average 1.5919003115264798) internal successors, (511), 325 states have internal predecessors, (511), 64 states have call successors, (64), 22 states have call predecessors, (64), 24 states have return successors, (69), 62 states have call predecessors, (69), 63 states have call successors, (69) [2025-01-09 03:54:05,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 644 transitions. [2025-01-09 03:54:05,588 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 644 transitions. Word has length 109 [2025-01-09 03:54:05,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:05,589 INFO L471 AbstractCegarLoop]: Abstraction has 410 states and 644 transitions. [2025-01-09 03:54:05,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:54:05,589 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 644 transitions. [2025-01-09 03:54:05,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 03:54:05,591 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:05,591 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:05,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:54:05,591 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:05,591 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:05,592 INFO L85 PathProgramCache]: Analyzing trace with hash -1394490271, now seen corresponding path program 2 times [2025-01-09 03:54:05,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:05,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608319500] [2025-01-09 03:54:05,592 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:54:05,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:05,607 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-01-09 03:54:05,611 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 45 of 110 statements. [2025-01-09 03:54:05,612 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:54:05,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:05,751 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:54:05,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:05,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608319500] [2025-01-09 03:54:05,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608319500] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:05,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:05,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:54:05,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182563003] [2025-01-09 03:54:05,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:05,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:54:05,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:05,753 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:54:05,753 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:05,753 INFO L87 Difference]: Start difference. First operand 410 states and 644 transitions. Second operand has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:06,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:06,084 INFO L93 Difference]: Finished difference Result 830 states and 1311 transitions. [2025-01-09 03:54:06,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:54:06,085 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 110 [2025-01-09 03:54:06,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:06,091 INFO L225 Difference]: With dead ends: 830 [2025-01-09 03:54:06,091 INFO L226 Difference]: Without dead ends: 826 [2025-01-09 03:54:06,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:54:06,092 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 493 mSDsluCounter, 3081 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 494 SdHoareTripleChecker+Valid, 3622 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:06,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [494 Valid, 3622 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 243 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:54:06,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 826 states. [2025-01-09 03:54:06,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 826 to 815. [2025-01-09 03:54:06,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 815 states, 640 states have (on average 1.596875) internal successors, (1022), 645 states have internal predecessors, (1022), 126 states have call successors, (126), 45 states have call predecessors, (126), 48 states have return successors, (140), 124 states have call predecessors, (140), 124 states have call successors, (140) [2025-01-09 03:54:06,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1288 transitions. [2025-01-09 03:54:06,132 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1288 transitions. Word has length 110 [2025-01-09 03:54:06,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:06,133 INFO L471 AbstractCegarLoop]: Abstraction has 815 states and 1288 transitions. [2025-01-09 03:54:06,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.625) internal successors, (69), 7 states have internal predecessors, (69), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:06,133 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1288 transitions. [2025-01-09 03:54:06,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 03:54:06,137 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:06,137 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:06,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:54:06,137 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:06,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:06,138 INFO L85 PathProgramCache]: Analyzing trace with hash -420737482, now seen corresponding path program 1 times [2025-01-09 03:54:06,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:06,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256029263] [2025-01-09 03:54:06,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:06,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:06,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 03:54:06,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 03:54:06,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:06,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:06,249 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:54:06,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:06,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256029263] [2025-01-09 03:54:06,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256029263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:06,250 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:06,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:54:06,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838844101] [2025-01-09 03:54:06,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:06,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:06,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:06,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:06,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:54:06,251 INFO L87 Difference]: Start difference. First operand 815 states and 1288 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:54:06,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:06,315 INFO L93 Difference]: Finished difference Result 1599 states and 2536 transitions. [2025-01-09 03:54:06,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:06,316 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 111 [2025-01-09 03:54:06,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:06,320 INFO L225 Difference]: With dead ends: 1599 [2025-01-09 03:54:06,320 INFO L226 Difference]: Without dead ends: 819 [2025-01-09 03:54:06,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:54:06,322 INFO L435 NwaCegarLoop]: 521 mSDtfsCounter, 1 mSDsluCounter, 1551 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2072 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:06,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2072 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:06,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2025-01-09 03:54:06,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 819. [2025-01-09 03:54:06,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 819 states, 642 states have (on average 1.5950155763239875) internal successors, (1024), 649 states have internal predecessors, (1024), 126 states have call successors, (126), 45 states have call predecessors, (126), 50 states have return successors, (143), 124 states have call predecessors, (143), 124 states have call successors, (143) [2025-01-09 03:54:06,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 1293 transitions. [2025-01-09 03:54:06,351 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 1293 transitions. Word has length 111 [2025-01-09 03:54:06,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:06,351 INFO L471 AbstractCegarLoop]: Abstraction has 819 states and 1293 transitions. [2025-01-09 03:54:06,351 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:54:06,351 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 1293 transitions. [2025-01-09 03:54:06,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:54:06,354 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:06,354 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] [2025-01-09 03:54:06,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:54:06,354 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:06,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:06,355 INFO L85 PathProgramCache]: Analyzing trace with hash -496149635, now seen corresponding path program 1 times [2025-01-09 03:54:06,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:06,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844773300] [2025-01-09 03:54:06,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:06,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:06,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:54:06,376 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:54:06,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:06,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:06,463 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:54:06,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:06,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844773300] [2025-01-09 03:54:06,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844773300] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:06,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:06,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:54:06,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316018040] [2025-01-09 03:54:06,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:06,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:54:06,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:06,464 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:54:06,464 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:06,465 INFO L87 Difference]: Start difference. First operand 819 states and 1293 transitions. Second operand has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-01-09 03:54:06,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:06,581 INFO L93 Difference]: Finished difference Result 1598 states and 2529 transitions. [2025-01-09 03:54:06,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:54:06,581 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 112 [2025-01-09 03:54:06,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:06,586 INFO L225 Difference]: With dead ends: 1598 [2025-01-09 03:54:06,586 INFO L226 Difference]: Without dead ends: 823 [2025-01-09 03:54:06,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:54:06,589 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 7 mSDsluCounter, 3037 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3548 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:06,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3548 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:54:06,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 823 states. [2025-01-09 03:54:06,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 823 to 821. [2025-01-09 03:54:06,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 821 states, 644 states have (on average 1.593167701863354) internal successors, (1026), 650 states have internal predecessors, (1026), 126 states have call successors, (126), 46 states have call predecessors, (126), 50 states have return successors, (141), 124 states have call predecessors, (141), 124 states have call successors, (141) [2025-01-09 03:54:06,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 821 states to 821 states and 1293 transitions. [2025-01-09 03:54:06,618 INFO L78 Accepts]: Start accepts. Automaton has 821 states and 1293 transitions. Word has length 112 [2025-01-09 03:54:06,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:06,619 INFO L471 AbstractCegarLoop]: Abstraction has 821 states and 1293 transitions. [2025-01-09 03:54:06,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.571428571428571) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-01-09 03:54:06,619 INFO L276 IsEmpty]: Start isEmpty. Operand 821 states and 1293 transitions. [2025-01-09 03:54:06,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:54:06,622 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:06,622 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:06,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:54:06,622 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:06,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:06,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1698688268, now seen corresponding path program 2 times [2025-01-09 03:54:06,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:06,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176486622] [2025-01-09 03:54:06,623 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:54:06,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:06,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 113 statements into 2 equivalence classes. [2025-01-09 03:54:06,640 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 113 statements. [2025-01-09 03:54:06,641 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:54:06,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:06,756 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:54:06,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:06,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176486622] [2025-01-09 03:54:06,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176486622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:06,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:06,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:54:06,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523829079] [2025-01-09 03:54:06,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:06,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:54:06,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:06,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:54:06,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:06,758 INFO L87 Difference]: Start difference. First operand 821 states and 1293 transitions. Second operand has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:07,078 INFO L93 Difference]: Finished difference Result 1667 states and 2645 transitions. [2025-01-09 03:54:07,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:54:07,079 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 113 [2025-01-09 03:54:07,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:07,087 INFO L225 Difference]: With dead ends: 1667 [2025-01-09 03:54:07,088 INFO L226 Difference]: Without dead ends: 1661 [2025-01-09 03:54:07,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:54:07,089 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 888 mSDsluCounter, 2571 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 889 SdHoareTripleChecker+Valid, 3118 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:07,089 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [889 Valid, 3118 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:54:07,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1661 states. [2025-01-09 03:54:07,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1661 to 1639. [2025-01-09 03:54:07,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1286 states have (on average 1.5948678071539657) internal successors, (2051), 1300 states have internal predecessors, (2051), 248 states have call successors, (248), 92 states have call predecessors, (248), 104 states have return successors, (304), 246 states have call predecessors, (304), 244 states have call successors, (304) [2025-01-09 03:54:07,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2603 transitions. [2025-01-09 03:54:07,154 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2603 transitions. Word has length 113 [2025-01-09 03:54:07,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:07,154 INFO L471 AbstractCegarLoop]: Abstraction has 1639 states and 2603 transitions. [2025-01-09 03:54:07,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.125) internal successors, (73), 7 states have internal predecessors, (73), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:07,155 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2603 transitions. [2025-01-09 03:54:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:54:07,160 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:07,160 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:07,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:54:07,160 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:07,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:07,161 INFO L85 PathProgramCache]: Analyzing trace with hash 836567794, now seen corresponding path program 1 times [2025-01-09 03:54:07,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:07,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763234111] [2025-01-09 03:54:07,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:07,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:07,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:54:07,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:54:07,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:07,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:07,275 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 03:54:07,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:07,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763234111] [2025-01-09 03:54:07,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763234111] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:07,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [306441326] [2025-01-09 03:54:07,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:07,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:07,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:07,279 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:54:07,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:54:07,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:54:07,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:54:07,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:07,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:07,507 INFO L256 TraceCheckSpWp]: Trace formula consists of 973 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:54:07,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:07,542 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-01-09 03:54:07,542 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:54:07,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [306441326] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:07,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:54:07,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:54:07,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898677174] [2025-01-09 03:54:07,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:07,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:54:07,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:07,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:54:07,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:07,544 INFO L87 Difference]: Start difference. First operand 1639 states and 2603 transitions. Second operand has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:07,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:07,619 INFO L93 Difference]: Finished difference Result 2471 states and 3916 transitions. [2025-01-09 03:54:07,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:54:07,619 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 113 [2025-01-09 03:54:07,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:07,628 INFO L225 Difference]: With dead ends: 2471 [2025-01-09 03:54:07,628 INFO L226 Difference]: Without dead ends: 1643 [2025-01-09 03:54:07,632 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:07,632 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 1 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2062 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:07,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2062 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:07,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2025-01-09 03:54:07,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1635. [2025-01-09 03:54:07,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1635 states, 1284 states have (on average 1.5950155763239875) internal successors, (2048), 1298 states have internal predecessors, (2048), 246 states have call successors, (246), 92 states have call predecessors, (246), 104 states have return successors, (302), 244 states have call predecessors, (302), 242 states have call successors, (302) [2025-01-09 03:54:07,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1635 states to 1635 states and 2596 transitions. [2025-01-09 03:54:07,695 INFO L78 Accepts]: Start accepts. Automaton has 1635 states and 2596 transitions. Word has length 113 [2025-01-09 03:54:07,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:07,696 INFO L471 AbstractCegarLoop]: Abstraction has 1635 states and 2596 transitions. [2025-01-09 03:54:07,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.2) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:07,696 INFO L276 IsEmpty]: Start isEmpty. Operand 1635 states and 2596 transitions. [2025-01-09 03:54:07,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 03:54:07,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:07,701 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:54:07,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 03:54:07,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 03:54:07,902 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:07,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:07,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1093033319, now seen corresponding path program 1 times [2025-01-09 03:54:07,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:07,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842851281] [2025-01-09 03:54:07,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:07,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:07,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:54:07,920 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:54:07,920 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:07,921 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:08,117 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:54:08,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:08,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1842851281] [2025-01-09 03:54:08,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1842851281] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:08,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:08,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:54:08,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134882153] [2025-01-09 03:54:08,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:08,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:54:08,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:08,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:54:08,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:54:08,119 INFO L87 Difference]: Start difference. First operand 1635 states and 2596 transitions. Second operand has 8 states, 7 states have (on average 10.857142857142858) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-01-09 03:54:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:08,286 INFO L93 Difference]: Finished difference Result 3211 states and 5108 transitions. [2025-01-09 03:54:08,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:54:08,286 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.857142857142858) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 114 [2025-01-09 03:54:08,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:08,297 INFO L225 Difference]: With dead ends: 3211 [2025-01-09 03:54:08,298 INFO L226 Difference]: Without dead ends: 1643 [2025-01-09 03:54:08,304 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:54:08,305 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 5 mSDsluCounter, 3049 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3562 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:08,305 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3562 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:54:08,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1643 states. [2025-01-09 03:54:08,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1643 to 1639. [2025-01-09 03:54:08,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1639 states, 1288 states have (on average 1.593167701863354) internal successors, (2052), 1301 states have internal predecessors, (2052), 246 states have call successors, (246), 93 states have call predecessors, (246), 104 states have return successors, (298), 244 states have call predecessors, (298), 242 states have call successors, (298) [2025-01-09 03:54:08,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1639 states to 1639 states and 2596 transitions. [2025-01-09 03:54:08,379 INFO L78 Accepts]: Start accepts. Automaton has 1639 states and 2596 transitions. Word has length 114 [2025-01-09 03:54:08,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:08,379 INFO L471 AbstractCegarLoop]: Abstraction has 1639 states and 2596 transitions. [2025-01-09 03:54:08,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.857142857142858) internal successors, (76), 8 states have internal predecessors, (76), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-01-09 03:54:08,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1639 states and 2596 transitions. [2025-01-09 03:54:08,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 03:54:08,385 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:08,386 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] [2025-01-09 03:54:08,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:54:08,386 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:08,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:08,387 INFO L85 PathProgramCache]: Analyzing trace with hash -915060869, now seen corresponding path program 1 times [2025-01-09 03:54:08,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:08,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703960568] [2025-01-09 03:54:08,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:08,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:08,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 03:54:08,409 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 03:54:08,410 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:08,410 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:08,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703960568] [2025-01-09 03:54:08,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703960568] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:54:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1603684214] [2025-01-09 03:54:08,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:08,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:08,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:54:08,466 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:54:08,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 03:54:08,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-09 03:54:08,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 03:54:08,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:08,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:08,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:54:08,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:54:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:08,693 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:54:08,791 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:08,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1603684214] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:54:08,792 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:54:08,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:54:08,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443235557] [2025-01-09 03:54:08,792 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:54:08,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:54:08,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:08,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:54:08,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:54:08,793 INFO L87 Difference]: Start difference. First operand 1639 states and 2596 transitions. Second operand has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:54:08,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:08,974 INFO L93 Difference]: Finished difference Result 3921 states and 6456 transitions. [2025-01-09 03:54:08,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:54:08,974 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 115 [2025-01-09 03:54:08,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:08,991 INFO L225 Difference]: With dead ends: 3921 [2025-01-09 03:54:08,992 INFO L226 Difference]: Without dead ends: 3283 [2025-01-09 03:54:08,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:54:08,997 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 485 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 2029 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:08,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 2029 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:54:09,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3283 states. [2025-01-09 03:54:09,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3283 to 3187. [2025-01-09 03:54:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3187 states, 2520 states have (on average 1.6507936507936507) internal successors, (4160), 2533 states have internal predecessors, (4160), 562 states have call successors, (562), 93 states have call predecessors, (562), 104 states have return successors, (694), 560 states have call predecessors, (694), 558 states have call successors, (694) [2025-01-09 03:54:09,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3187 states to 3187 states and 5416 transitions. [2025-01-09 03:54:09,116 INFO L78 Accepts]: Start accepts. Automaton has 3187 states and 5416 transitions. Word has length 115 [2025-01-09 03:54:09,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:09,117 INFO L471 AbstractCegarLoop]: Abstraction has 3187 states and 5416 transitions. [2025-01-09 03:54:09,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.285714285714286) internal successors, (100), 7 states have internal predecessors, (100), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2025-01-09 03:54:09,117 INFO L276 IsEmpty]: Start isEmpty. Operand 3187 states and 5416 transitions. [2025-01-09 03:54:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 03:54:09,130 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:09,130 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] [2025-01-09 03:54:09,140 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 03:54:09,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:54:09,332 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:09,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:09,333 INFO L85 PathProgramCache]: Analyzing trace with hash 870666816, now seen corresponding path program 1 times [2025-01-09 03:54:09,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:09,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324148132] [2025-01-09 03:54:09,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:09,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:09,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 03:54:09,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 03:54:09,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:09,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:09,394 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:09,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:09,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324148132] [2025-01-09 03:54:09,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324148132] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:09,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:09,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:09,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983495983] [2025-01-09 03:54:09,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:09,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:09,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:09,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:09,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:09,396 INFO L87 Difference]: Start difference. First operand 3187 states and 5416 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:09,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:09,547 INFO L93 Difference]: Finished difference Result 7713 states and 13304 transitions. [2025-01-09 03:54:09,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:09,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2025-01-09 03:54:09,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:09,573 INFO L225 Difference]: With dead ends: 7713 [2025-01-09 03:54:09,573 INFO L226 Difference]: Without dead ends: 4751 [2025-01-09 03:54:09,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:09,584 INFO L435 NwaCegarLoop]: 545 mSDtfsCounter, 124 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:09,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 1070 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:09,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4751 states. [2025-01-09 03:54:09,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4751 to 4719. [2025-01-09 03:54:09,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4719 states, 3736 states have (on average 1.6627408993576016) internal successors, (6212), 3749 states have internal predecessors, (6212), 878 states have call successors, (878), 93 states have call predecessors, (878), 104 states have return successors, (1090), 876 states have call predecessors, (1090), 874 states have call successors, (1090) [2025-01-09 03:54:09,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4719 states to 4719 states and 8180 transitions. [2025-01-09 03:54:09,784 INFO L78 Accepts]: Start accepts. Automaton has 4719 states and 8180 transitions. Word has length 122 [2025-01-09 03:54:09,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:09,785 INFO L471 AbstractCegarLoop]: Abstraction has 4719 states and 8180 transitions. [2025-01-09 03:54:09,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:09,785 INFO L276 IsEmpty]: Start isEmpty. Operand 4719 states and 8180 transitions. [2025-01-09 03:54:09,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 03:54:09,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:09,857 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] [2025-01-09 03:54:09,858 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:54:09,858 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:09,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:09,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1716756269, now seen corresponding path program 1 times [2025-01-09 03:54:09,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:09,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66687542] [2025-01-09 03:54:09,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:09,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:09,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 03:54:09,883 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:54:09,884 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:09,884 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:09,919 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:09,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:09,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66687542] [2025-01-09 03:54:09,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66687542] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:09,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:09,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:09,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020387371] [2025-01-09 03:54:09,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:09,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:09,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:09,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:09,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:09,921 INFO L87 Difference]: Start difference. First operand 4719 states and 8180 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:10,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:10,076 INFO L93 Difference]: Finished difference Result 11441 states and 19972 transitions. [2025-01-09 03:54:10,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:10,077 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2025-01-09 03:54:10,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:10,128 INFO L225 Difference]: With dead ends: 11441 [2025-01-09 03:54:10,129 INFO L226 Difference]: Without dead ends: 7151 [2025-01-09 03:54:10,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:10,148 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 122 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:10,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 1048 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:10,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7151 states. [2025-01-09 03:54:10,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7151 to 7119. [2025-01-09 03:54:10,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7119 states, 5660 states have (on average 1.6706713780918727) internal successors, (9456), 5673 states have internal predecessors, (9456), 1354 states have call successors, (1354), 93 states have call predecessors, (1354), 104 states have return successors, (1630), 1352 states have call predecessors, (1630), 1350 states have call successors, (1630) [2025-01-09 03:54:10,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7119 states to 7119 states and 12440 transitions. [2025-01-09 03:54:10,529 INFO L78 Accepts]: Start accepts. Automaton has 7119 states and 12440 transitions. Word has length 123 [2025-01-09 03:54:10,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:10,529 INFO L471 AbstractCegarLoop]: Abstraction has 7119 states and 12440 transitions. [2025-01-09 03:54:10,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:10,530 INFO L276 IsEmpty]: Start isEmpty. Operand 7119 states and 12440 transitions. [2025-01-09 03:54:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 03:54:10,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:10,566 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] [2025-01-09 03:54:10,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:54:10,566 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:10,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:10,567 INFO L85 PathProgramCache]: Analyzing trace with hash 2008752386, now seen corresponding path program 1 times [2025-01-09 03:54:10,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:10,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135074403] [2025-01-09 03:54:10,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:10,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:10,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 03:54:10,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 03:54:10,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:10,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:10,623 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:10,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:10,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135074403] [2025-01-09 03:54:10,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135074403] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:10,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:10,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:10,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262365252] [2025-01-09 03:54:10,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:10,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:10,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:10,625 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:10,625 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:10,626 INFO L87 Difference]: Start difference. First operand 7119 states and 12440 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:10,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:10,881 INFO L93 Difference]: Finished difference Result 17029 states and 30028 transitions. [2025-01-09 03:54:10,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:10,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2025-01-09 03:54:10,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:10,929 INFO L225 Difference]: With dead ends: 17029 [2025-01-09 03:54:10,929 INFO L226 Difference]: Without dead ends: 10823 [2025-01-09 03:54:10,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:10,953 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 120 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:10,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1043 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:10,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10823 states. [2025-01-09 03:54:11,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10823 to 10791. [2025-01-09 03:54:11,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10791 states, 8684 states have (on average 1.677567941040995) internal successors, (14568), 8697 states have internal predecessors, (14568), 2002 states have call successors, (2002), 93 states have call predecessors, (2002), 104 states have return successors, (2446), 2000 states have call predecessors, (2446), 1998 states have call successors, (2446) [2025-01-09 03:54:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10791 states to 10791 states and 19016 transitions. [2025-01-09 03:54:11,372 INFO L78 Accepts]: Start accepts. Automaton has 10791 states and 19016 transitions. Word has length 124 [2025-01-09 03:54:11,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:11,373 INFO L471 AbstractCegarLoop]: Abstraction has 10791 states and 19016 transitions. [2025-01-09 03:54:11,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:11,373 INFO L276 IsEmpty]: Start isEmpty. Operand 10791 states and 19016 transitions. [2025-01-09 03:54:11,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 03:54:11,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:11,412 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] [2025-01-09 03:54:11,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:54:11,413 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:11,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:11,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1841497236, now seen corresponding path program 1 times [2025-01-09 03:54:11,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:11,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931713909] [2025-01-09 03:54:11,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:11,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:11,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:54:11,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:54:11,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:11,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:11,460 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:11,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:11,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931713909] [2025-01-09 03:54:11,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [931713909] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:11,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:11,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:11,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236854961] [2025-01-09 03:54:11,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:11,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:11,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:11,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:11,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:11,463 INFO L87 Difference]: Start difference. First operand 10791 states and 19016 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:11,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:11,826 INFO L93 Difference]: Finished difference Result 25841 states and 45932 transitions. [2025-01-09 03:54:11,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:11,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2025-01-09 03:54:11,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:11,899 INFO L225 Difference]: With dead ends: 25841 [2025-01-09 03:54:11,899 INFO L226 Difference]: Without dead ends: 16751 [2025-01-09 03:54:11,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:11,937 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 118 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 1043 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:11,937 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 1043 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:11,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16751 states. [2025-01-09 03:54:12,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16751 to 16719. [2025-01-09 03:54:12,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16719 states, 13632 states have (on average 1.682511737089202) internal successors, (22936), 13645 states have internal predecessors, (22936), 2982 states have call successors, (2982), 93 states have call predecessors, (2982), 104 states have return successors, (3706), 2980 states have call predecessors, (3706), 2978 states have call successors, (3706) [2025-01-09 03:54:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16719 states to 16719 states and 29624 transitions. [2025-01-09 03:54:12,749 INFO L78 Accepts]: Start accepts. Automaton has 16719 states and 29624 transitions. Word has length 125 [2025-01-09 03:54:12,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:12,750 INFO L471 AbstractCegarLoop]: Abstraction has 16719 states and 29624 transitions. [2025-01-09 03:54:12,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:12,750 INFO L276 IsEmpty]: Start isEmpty. Operand 16719 states and 29624 transitions. [2025-01-09 03:54:12,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 03:54:12,814 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:12,814 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] [2025-01-09 03:54:12,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:54:12,814 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:12,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:12,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1971901858, now seen corresponding path program 1 times [2025-01-09 03:54:12,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:12,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370289453] [2025-01-09 03:54:12,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:12,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:12,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 03:54:12,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 03:54:12,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:12,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:12,884 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:12,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:12,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370289453] [2025-01-09 03:54:12,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370289453] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:12,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:12,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:12,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273407118] [2025-01-09 03:54:12,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:12,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:12,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:12,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:12,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:12,886 INFO L87 Difference]: Start difference. First operand 16719 states and 29624 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:13,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:13,507 INFO L93 Difference]: Finished difference Result 41597 states and 74160 transitions. [2025-01-09 03:54:13,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:13,508 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2025-01-09 03:54:13,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:13,629 INFO L225 Difference]: With dead ends: 41597 [2025-01-09 03:54:13,629 INFO L226 Difference]: Without dead ends: 27463 [2025-01-09 03:54:13,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:13,677 INFO L435 NwaCegarLoop]: 549 mSDtfsCounter, 116 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 1075 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:13,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 1075 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:13,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27463 states. [2025-01-09 03:54:14,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27463 to 27431. [2025-01-09 03:54:14,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27431 states, 22372 states have (on average 1.6778115501519757) internal successors, (37536), 22385 states have internal predecessors, (37536), 4954 states have call successors, (4954), 93 states have call predecessors, (4954), 104 states have return successors, (6166), 4952 states have call predecessors, (6166), 4950 states have call successors, (6166) [2025-01-09 03:54:14,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27431 states to 27431 states and 48656 transitions. [2025-01-09 03:54:14,807 INFO L78 Accepts]: Start accepts. Automaton has 27431 states and 48656 transitions. Word has length 126 [2025-01-09 03:54:14,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:14,807 INFO L471 AbstractCegarLoop]: Abstraction has 27431 states and 48656 transitions. [2025-01-09 03:54:14,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:14,808 INFO L276 IsEmpty]: Start isEmpty. Operand 27431 states and 48656 transitions. [2025-01-09 03:54:14,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 03:54:14,866 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:14,866 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] [2025-01-09 03:54:14,867 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:54:14,867 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:14,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:14,867 INFO L85 PathProgramCache]: Analyzing trace with hash 116052792, now seen corresponding path program 1 times [2025-01-09 03:54:14,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:14,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905885021] [2025-01-09 03:54:14,868 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:14,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:14,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:54:14,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:54:14,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:14,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:14,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:14,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905885021] [2025-01-09 03:54:14,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905885021] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:14,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:14,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:14,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302613736] [2025-01-09 03:54:14,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:14,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:14,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:14,919 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:14,919 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:14,920 INFO L87 Difference]: Start difference. First operand 27431 states and 48656 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:16,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:16,052 INFO L93 Difference]: Finished difference Result 69625 states and 123984 transitions. [2025-01-09 03:54:16,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:16,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2025-01-09 03:54:16,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:16,234 INFO L225 Difference]: With dead ends: 69625 [2025-01-09 03:54:16,234 INFO L226 Difference]: Without dead ends: 46223 [2025-01-09 03:54:16,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:16,291 INFO L435 NwaCegarLoop]: 528 mSDtfsCounter, 114 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:16,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 1048 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:16,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46223 states. [2025-01-09 03:54:17,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46223 to 46191. [2025-01-09 03:54:17,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46191 states, 37844 states have (on average 1.6772011415283796) internal successors, (63472), 37857 states have internal predecessors, (63472), 8242 states have call successors, (8242), 93 states have call predecessors, (8242), 104 states have return successors, (10054), 8240 states have call predecessors, (10054), 8238 states have call successors, (10054) [2025-01-09 03:54:18,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46191 states to 46191 states and 81768 transitions. [2025-01-09 03:54:18,241 INFO L78 Accepts]: Start accepts. Automaton has 46191 states and 81768 transitions. Word has length 127 [2025-01-09 03:54:18,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:18,241 INFO L471 AbstractCegarLoop]: Abstraction has 46191 states and 81768 transitions. [2025-01-09 03:54:18,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:18,242 INFO L276 IsEmpty]: Start isEmpty. Operand 46191 states and 81768 transitions. [2025-01-09 03:54:18,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 03:54:18,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:18,326 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] [2025-01-09 03:54:18,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:54:18,327 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:18,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:18,327 INFO L85 PathProgramCache]: Analyzing trace with hash 260162304, now seen corresponding path program 1 times [2025-01-09 03:54:18,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:18,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259936707] [2025-01-09 03:54:18,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:18,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:18,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 03:54:18,348 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 03:54:18,348 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:18,348 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:18,377 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:18,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:18,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259936707] [2025-01-09 03:54:18,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259936707] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:18,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:18,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:18,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175202509] [2025-01-09 03:54:18,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:18,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:18,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:18,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:18,379 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:18,380 INFO L87 Difference]: Start difference. First operand 46191 states and 81768 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:20,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:20,293 INFO L93 Difference]: Finished difference Result 110405 states and 195532 transitions. [2025-01-09 03:54:20,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:20,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2025-01-09 03:54:20,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:20,578 INFO L225 Difference]: With dead ends: 110405 [2025-01-09 03:54:20,579 INFO L226 Difference]: Without dead ends: 71931 [2025-01-09 03:54:20,678 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:20,680 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 112 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:20,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 1018 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:20,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71931 states. [2025-01-09 03:54:23,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71931 to 71899. [2025-01-09 03:54:23,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71899 states, 58740 states have (on average 1.6525706503234594) internal successors, (97072), 58753 states have internal predecessors, (97072), 13054 states have call successors, (13054), 93 states have call predecessors, (13054), 104 states have return successors, (16278), 13052 states have call predecessors, (16278), 13050 states have call successors, (16278) [2025-01-09 03:54:23,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71899 states to 71899 states and 126404 transitions. [2025-01-09 03:54:23,527 INFO L78 Accepts]: Start accepts. Automaton has 71899 states and 126404 transitions. Word has length 128 [2025-01-09 03:54:23,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:23,528 INFO L471 AbstractCegarLoop]: Abstraction has 71899 states and 126404 transitions. [2025-01-09 03:54:23,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:23,528 INFO L276 IsEmpty]: Start isEmpty. Operand 71899 states and 126404 transitions. [2025-01-09 03:54:23,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 03:54:23,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:23,621 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] [2025-01-09 03:54:23,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:54:23,621 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:23,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:23,622 INFO L85 PathProgramCache]: Analyzing trace with hash 184255129, now seen corresponding path program 1 times [2025-01-09 03:54:23,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:23,622 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438935000] [2025-01-09 03:54:23,622 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:23,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:23,639 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 03:54:23,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 03:54:23,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:23,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:23,672 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:23,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:23,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438935000] [2025-01-09 03:54:23,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438935000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:23,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:23,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:23,673 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031691525] [2025-01-09 03:54:23,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:23,674 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:23,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:23,674 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:23,674 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:23,675 INFO L87 Difference]: Start difference. First operand 71899 states and 126404 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:26,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:26,853 INFO L93 Difference]: Finished difference Result 190333 states and 336048 transitions. [2025-01-09 03:54:26,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:26,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2025-01-09 03:54:26,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:27,375 INFO L225 Difference]: With dead ends: 190333 [2025-01-09 03:54:27,376 INFO L226 Difference]: Without dead ends: 128463 [2025-01-09 03:54:27,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:27,527 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 110 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:27,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 1046 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:27,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128463 states. [2025-01-09 03:54:31,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128463 to 128431. [2025-01-09 03:54:31,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128431 states, 105472 states have (on average 1.6486650485436893) internal successors, (173888), 105485 states have internal predecessors, (173888), 22854 states have call successors, (22854), 93 states have call predecessors, (22854), 104 states have return successors, (28786), 22852 states have call predecessors, (28786), 22850 states have call successors, (28786) [2025-01-09 03:54:32,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128431 states to 128431 states and 225528 transitions. [2025-01-09 03:54:32,279 INFO L78 Accepts]: Start accepts. Automaton has 128431 states and 225528 transitions. Word has length 129 [2025-01-09 03:54:32,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:54:32,280 INFO L471 AbstractCegarLoop]: Abstraction has 128431 states and 225528 transitions. [2025-01-09 03:54:32,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:32,280 INFO L276 IsEmpty]: Start isEmpty. Operand 128431 states and 225528 transitions. [2025-01-09 03:54:32,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 03:54:32,397 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:54:32,397 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] [2025-01-09 03:54:32,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:54:32,397 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:54:32,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:54:32,398 INFO L85 PathProgramCache]: Analyzing trace with hash -381928774, now seen corresponding path program 1 times [2025-01-09 03:54:32,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:54:32,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [981035385] [2025-01-09 03:54:32,398 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:54:32,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:54:32,411 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:54:32,420 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:54:32,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:54:32,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:54:32,447 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:54:32,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:54:32,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [981035385] [2025-01-09 03:54:32,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [981035385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:54:32,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:54:32,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:54:32,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247802346] [2025-01-09 03:54:32,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:54:32,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:54:32,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:54:32,448 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:54:32,449 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:32,449 INFO L87 Difference]: Start difference. First operand 128431 states and 225528 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:54:38,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:54:38,439 INFO L93 Difference]: Finished difference Result 350581 states and 615576 transitions. [2025-01-09 03:54:38,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:54:38,443 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 130 [2025-01-09 03:54:38,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:54:39,418 INFO L225 Difference]: With dead ends: 350581 [2025-01-09 03:54:39,418 INFO L226 Difference]: Without dead ends: 235535 [2025-01-09 03:54:39,719 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:54:39,724 INFO L435 NwaCegarLoop]: 526 mSDtfsCounter, 108 mSDsluCounter, 520 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 1046 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:54:39,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 1046 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:54:39,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235535 states.