./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product38.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product38.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bd6587ac6cf18c69f9c15caef5354ee5ad606346c35154ee0861ae3e169457d6 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-19 21:48:43,038 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 21:48:43,114 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 21:48:43,119 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 21:48:43,120 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 21:48:43,146 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 21:48:43,146 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 21:48:43,147 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 21:48:43,147 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 21:48:43,148 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 21:48:43,148 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 21:48:43,149 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 21:48:43,149 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 21:48:43,153 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 21:48:43,153 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 21:48:43,153 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 21:48:43,154 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 21:48:43,154 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 21:48:43,154 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 21:48:43,155 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 21:48:43,155 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 21:48:43,157 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 21:48:43,157 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 21:48:43,157 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 21:48:43,158 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 21:48:43,158 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 21:48:43,158 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 21:48:43,158 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 21:48:43,158 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 21:48:43,159 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 21:48:43,159 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 21:48:43,160 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 21:48:43,160 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:48:43,161 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 21:48:43,161 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 21:48:43,161 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 21:48:43,161 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 21:48:43,161 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 21:48:43,162 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 21:48:43,162 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 21:48:43,162 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 21:48:43,162 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 21:48:43,162 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> bd6587ac6cf18c69f9c15caef5354ee5ad606346c35154ee0861ae3e169457d6 [2024-11-19 21:48:43,411 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 21:48:43,433 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 21:48:43,437 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 21:48:43,439 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 21:48:43,439 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 21:48:43,440 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product38.cil.c [2024-11-19 21:48:44,884 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 21:48:45,230 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 21:48:45,230 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product38.cil.c [2024-11-19 21:48:45,258 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c609d57/7729a2346ee1423a885633e36573b2df/FLAGbcfeea1f6 [2024-11-19 21:48:45,275 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c609d57/7729a2346ee1423a885633e36573b2df [2024-11-19 21:48:45,278 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 21:48:45,280 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 21:48:45,282 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 21:48:45,282 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 21:48:45,288 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 21:48:45,288 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:48:45" (1/1) ... [2024-11-19 21:48:45,291 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e918275 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:45, skipping insertion in model container [2024-11-19 21:48:45,291 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:48:45" (1/1) ... [2024-11-19 21:48:45,356 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 21:48:45,638 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product38.cil.c[9373,9386] [2024-11-19 21:48:45,857 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:48:45,872 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 21:48:45,884 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [48] [2024-11-19 21:48:45,886 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [460] [2024-11-19 21:48:45,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [469] [2024-11-19 21:48:45,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [801] [2024-11-19 21:48:45,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1167] [2024-11-19 21:48:45,887 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1386] [2024-11-19 21:48:45,888 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [2455] [2024-11-19 21:48:45,888 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2475] [2024-11-19 21:48:45,888 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2510] [2024-11-19 21:48:45,888 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2747] [2024-11-19 21:48:45,888 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2810] [2024-11-19 21:48:45,903 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product38.cil.c[9373,9386] [2024-11-19 21:48:45,996 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 21:48:46,027 INFO L204 MainTranslator]: Completed translation [2024-11-19 21:48:46,028 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46 WrapperNode [2024-11-19 21:48:46,028 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 21:48:46,029 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 21:48:46,029 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 21:48:46,029 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 21:48:46,040 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 21:48:46,068 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 21:48:46,120 INFO L138 Inliner]: procedures = 124, calls = 177, calls flagged for inlining = 49, calls inlined = 46, statements flattened = 873 [2024-11-19 21:48:46,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 21:48:46,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 21:48:46,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 21:48:46,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 21:48:46,133 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 21:48:46,133 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 21:48:46,139 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 21:48:46,167 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]. [2024-11-19 21:48:46,168 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 21:48:46,168 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 21:48:46,190 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 21:48:46,204 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 21:48:46,219 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 21:48:46,227 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 21:48:46,235 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 21:48:46,236 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 21:48:46,237 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 21:48:46,237 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 21:48:46,239 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 21:48:46,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 21:48:46,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:48:46,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 21:48:46,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 21:48:46,326 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2024-11-19 21:48:46,327 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2024-11-19 21:48:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2024-11-19 21:48:46,327 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2024-11-19 21:48:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2024-11-19 21:48:46,327 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2024-11-19 21:48:46,327 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-19 21:48:46,328 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-19 21:48:46,328 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-19 21:48:46,328 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-19 21:48:46,329 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-19 21:48:46,329 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-19 21:48:46,329 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-19 21:48:46,329 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-19 21:48:46,330 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-19 21:48:46,330 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-19 21:48:46,330 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-19 21:48:46,330 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-19 21:48:46,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 21:48:46,331 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2024-11-19 21:48:46,331 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2024-11-19 21:48:46,331 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-19 21:48:46,331 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-19 21:48:46,331 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-19 21:48:46,332 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-19 21:48:46,332 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-19 21:48:46,332 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-19 21:48:46,333 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-19 21:48:46,333 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-19 21:48:46,333 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-19 21:48:46,333 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-19 21:48:46,333 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-19 21:48:46,333 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-19 21:48:46,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 21:48:46,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 21:48:46,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 21:48:46,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 21:48:46,335 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-19 21:48:46,335 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-19 21:48:46,336 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2024-11-19 21:48:46,336 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2024-11-19 21:48:46,336 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 21:48:46,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 21:48:46,542 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 21:48:46,545 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 21:48:47,338 INFO L? ?]: Removed 411 outVars from TransFormulas that were not future-live. [2024-11-19 21:48:47,338 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 21:48:47,363 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 21:48:47,366 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 21:48:47,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:48:47 BoogieIcfgContainer [2024-11-19 21:48:47,367 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 21:48:47,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 21:48:47,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 21:48:47,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 21:48:47,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:48:45" (1/3) ... [2024-11-19 21:48:47,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf8c177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:48:47, skipping insertion in model container [2024-11-19 21:48:47,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (2/3) ... [2024-11-19 21:48:47,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cf8c177 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:48:47, skipping insertion in model container [2024-11-19 21:48:47,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:48:47" (3/3) ... [2024-11-19 21:48:47,376 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec0_product38.cil.c [2024-11-19 21:48:47,392 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 21:48:47,392 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 21:48:47,466 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 21:48:47,473 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;@108b3d1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 21:48:47,474 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 21:48:47,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 313 states, 246 states have (on average 1.5731707317073171) internal successors, (387), 249 states have internal predecessors, (387), 47 states have call successors, (47), 18 states have call predecessors, (47), 18 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) [2024-11-19 21:48:47,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-19 21:48:47,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:48:47,504 INFO L215 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] [2024-11-19 21:48:47,505 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:48:47,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:48:47,509 INFO L85 PathProgramCache]: Analyzing trace with hash -816330075, now seen corresponding path program 1 times [2024-11-19 21:48:47,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:48:47,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590681742] [2024-11-19 21:48:47,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:48:47,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:48:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:48,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:48:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:48,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:48:48,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:48,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:48:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:48,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:48:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:48,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:48:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:48,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:48:48,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:48,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-19 21:48:48,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:48,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-19 21:48:48,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:48,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-19 21:48:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:48,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:48:48,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:48,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-19 21:48:48,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:48,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-19 21:48:48,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:48,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:48:48,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:48,377 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-19 21:48:48,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:48:48,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590681742] [2024-11-19 21:48:48,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590681742] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:48:48,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [907109817] [2024-11-19 21:48:48,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:48:48,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:48:48,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:48:48,389 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:48:48,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 21:48:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:48,794 INFO L255 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 21:48:48,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:48:48,846 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-19 21:48:48,848 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:48:48,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [907109817] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:48:48,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:48:48,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-19 21:48:48,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503984459] [2024-11-19 21:48:48,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:48:48,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 21:48:48,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:48:48,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 21:48:48,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:48:48,884 INFO L87 Difference]: Start difference. First operand has 313 states, 246 states have (on average 1.5731707317073171) internal successors, (387), 249 states have internal predecessors, (387), 47 states have call successors, (47), 18 states have call predecessors, (47), 18 states have return successors, (47), 46 states have call predecessors, (47), 47 states have call successors, (47) Second operand has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (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) [2024-11-19 21:48:48,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:48:48,942 INFO L93 Difference]: Finished difference Result 433 states and 652 transitions. [2024-11-19 21:48:48,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 21:48:48,945 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (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 102 [2024-11-19 21:48:48,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:48:48,959 INFO L225 Difference]: With dead ends: 433 [2024-11-19 21:48:48,959 INFO L226 Difference]: Without dead ends: 306 [2024-11-19 21:48:48,964 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:48:48,967 INFO L432 NwaCegarLoop]: 477 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, 477 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 [2024-11-19 21:48:48,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:48:48,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-19 21:48:49,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 306. [2024-11-19 21:48:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 240 states have (on average 1.5666666666666667) internal successors, (376), 242 states have internal predecessors, (376), 47 states have call successors, (47), 18 states have call predecessors, (47), 18 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-19 21:48:49,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 469 transitions. [2024-11-19 21:48:49,033 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 469 transitions. Word has length 102 [2024-11-19 21:48:49,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:48:49,035 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 469 transitions. [2024-11-19 21:48:49,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.5) internal successors, (55), 2 states have internal predecessors, (55), 2 states have call successors, (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) [2024-11-19 21:48:49,035 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 469 transitions. [2024-11-19 21:48:49,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2024-11-19 21:48:49,041 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:48:49,042 INFO L215 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] [2024-11-19 21:48:49,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 21:48:49,245 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-19 21:48:49,246 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:48:49,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:48:49,247 INFO L85 PathProgramCache]: Analyzing trace with hash 818093159, now seen corresponding path program 1 times [2024-11-19 21:48:49,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:48:49,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437474618] [2024-11-19 21:48:49,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:48:49,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:48:49,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:49,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:48:49,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:49,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:48:49,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:49,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:48:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:49,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:48:49,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:49,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:48:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:49,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:48:49,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:49,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-19 21:48:49,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:49,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-19 21:48:49,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:49,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-19 21:48:49,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:49,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:48:49,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:49,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:48:49,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:49,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:48:49,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:49,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:48:49,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:49,576 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-19 21:48:49,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:48:49,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437474618] [2024-11-19 21:48:49,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437474618] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:48:49,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312307225] [2024-11-19 21:48:49,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:48:49,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:48:49,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:48:49,580 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:48:49,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 21:48:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:49,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 953 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-19 21:48:49,879 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:48:49,910 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-19 21:48:49,910 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:48:49,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312307225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:48:49,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:48:49,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-19 21:48:49,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568357051] [2024-11-19 21:48:49,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:48:49,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 21:48:49,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:48:49,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 21:48:49,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:48:49,914 INFO L87 Difference]: Start difference. First operand 306 states and 469 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (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) [2024-11-19 21:48:49,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:48:49,952 INFO L93 Difference]: Finished difference Result 423 states and 630 transitions. [2024-11-19 21:48:49,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 21:48:49,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (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 103 [2024-11-19 21:48:49,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:48:49,956 INFO L225 Difference]: With dead ends: 423 [2024-11-19 21:48:49,956 INFO L226 Difference]: Without dead ends: 309 [2024-11-19 21:48:49,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:48:49,961 INFO L432 NwaCegarLoop]: 467 mSDtfsCounter, 1 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 932 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 [2024-11-19 21:48:49,962 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 932 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:48:49,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2024-11-19 21:48:49,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 308. [2024-11-19 21:48:49,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 242 states have (on average 1.56198347107438) internal successors, (378), 244 states have internal predecessors, (378), 47 states have call successors, (47), 18 states have call predecessors, (47), 18 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-19 21:48:49,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 471 transitions. [2024-11-19 21:48:49,988 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 471 transitions. Word has length 103 [2024-11-19 21:48:49,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:48:49,989 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 471 transitions. [2024-11-19 21:48:49,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (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) [2024-11-19 21:48:49,989 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 471 transitions. [2024-11-19 21:48:49,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 21:48:49,992 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:48:49,992 INFO L215 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] [2024-11-19 21:48:50,005 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 21:48:50,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-19 21:48:50,193 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:48:50,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:48:50,194 INFO L85 PathProgramCache]: Analyzing trace with hash 695803230, now seen corresponding path program 1 times [2024-11-19 21:48:50,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:48:50,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476173302] [2024-11-19 21:48:50,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:48:50,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:48:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:50,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:48:50,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:50,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:48:50,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:50,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:48:50,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:50,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:48:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:50,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:48:50,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:50,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:48:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:50,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-19 21:48:50,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:50,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-19 21:48:50,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:50,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-19 21:48:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:50,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:48:50,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:50,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-19 21:48:50,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:50,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:48:50,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:50,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:48:50,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:50,470 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:48:50,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:48:50,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476173302] [2024-11-19 21:48:50,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476173302] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:48:50,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409501174] [2024-11-19 21:48:50,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:48:50,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:48:50,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:48:50,478 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:48:50,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 21:48:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:50,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 21:48:50,739 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:48:50,793 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-19 21:48:50,795 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:48:50,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409501174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:48:50,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:48:50,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-19 21:48:50,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545630579] [2024-11-19 21:48:50,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:48:50,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 21:48:50,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:48:50,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 21:48:50,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:48:50,799 INFO L87 Difference]: Start difference. First operand 308 states and 471 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2024-11-19 21:48:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:48:50,833 INFO L93 Difference]: Finished difference Result 664 states and 1034 transitions. [2024-11-19 21:48:50,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 21:48:50,834 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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 109 [2024-11-19 21:48:50,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:48:50,840 INFO L225 Difference]: With dead ends: 664 [2024-11-19 21:48:50,840 INFO L226 Difference]: Without dead ends: 383 [2024-11-19 21:48:50,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-19 21:48:50,845 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 134 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 910 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 [2024-11-19 21:48:50,845 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 910 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:48:50,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-11-19 21:48:50,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 375. [2024-11-19 21:48:50,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 295 states have (on average 1.583050847457627) internal successors, (467), 297 states have internal predecessors, (467), 61 states have call successors, (61), 18 states have call predecessors, (61), 18 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-19 21:48:50,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 588 transitions. [2024-11-19 21:48:50,872 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 588 transitions. Word has length 109 [2024-11-19 21:48:50,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:48:50,873 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 588 transitions. [2024-11-19 21:48:50,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 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) [2024-11-19 21:48:50,873 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 588 transitions. [2024-11-19 21:48:50,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-19 21:48:50,876 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:48:50,876 INFO L215 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] [2024-11-19 21:48:50,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 21:48:51,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:48:51,077 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:48:51,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:48:51,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1217435756, now seen corresponding path program 1 times [2024-11-19 21:48:51,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:48:51,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125137791] [2024-11-19 21:48:51,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:48:51,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:48:51,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:51,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:48:51,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:51,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:48:51,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:51,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:48:51,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:51,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-19 21:48:51,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:51,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-19 21:48:51,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:51,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-19 21:48:51,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:51,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-19 21:48:51,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:51,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-19 21:48:51,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:51,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 21:48:51,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:51,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:48:51,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:51,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-19 21:48:51,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:51,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:48:51,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:51,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:48:51,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:51,301 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:48:51,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:48:51,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125137791] [2024-11-19 21:48:51,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125137791] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:48:51,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667380211] [2024-11-19 21:48:51,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:48:51,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:48:51,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:48:51,304 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:48:51,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 21:48:51,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:51,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 21:48:51,568 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:48:51,655 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 21:48:51,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:48:51,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667380211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:48:51,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:48:51,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-19 21:48:51,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504268531] [2024-11-19 21:48:51,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:48:51,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:48:51,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:48:51,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:48:51,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:48:51,658 INFO L87 Difference]: Start difference. First operand 375 states and 588 transitions. Second operand has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (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) [2024-11-19 21:48:51,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:48:51,719 INFO L93 Difference]: Finished difference Result 741 states and 1166 transitions. [2024-11-19 21:48:51,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:48:51,720 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (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 110 [2024-11-19 21:48:51,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:48:51,723 INFO L225 Difference]: With dead ends: 741 [2024-11-19 21:48:51,723 INFO L226 Difference]: Without dead ends: 377 [2024-11-19 21:48:51,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:48:51,725 INFO L432 NwaCegarLoop]: 461 mSDtfsCounter, 2 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1833 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 [2024-11-19 21:48:51,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1833 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:48:51,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2024-11-19 21:48:51,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 377. [2024-11-19 21:48:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 296 states have (on average 1.5810810810810811) internal successors, (468), 299 states have internal predecessors, (468), 61 states have call successors, (61), 18 states have call predecessors, (61), 19 states have return successors, (62), 59 states have call predecessors, (62), 60 states have call successors, (62) [2024-11-19 21:48:51,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 591 transitions. [2024-11-19 21:48:51,761 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 591 transitions. Word has length 110 [2024-11-19 21:48:51,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:48:51,763 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 591 transitions. [2024-11-19 21:48:51,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.75) internal successors, (71), 5 states have internal predecessors, (71), 3 states have call successors, (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) [2024-11-19 21:48:51,766 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 591 transitions. [2024-11-19 21:48:51,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 21:48:51,768 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:48:51,768 INFO L215 NwaCegarLoop]: trace histogram [3, 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] [2024-11-19 21:48:51,779 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 21:48:51,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:48:51,969 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:48:51,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:48:51,970 INFO L85 PathProgramCache]: Analyzing trace with hash -1459654362, now seen corresponding path program 1 times [2024-11-19 21:48:51,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:48:51,970 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770291677] [2024-11-19 21:48:51,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:48:51,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:48:51,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:52,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:48:52,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:52,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:48:52,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:52,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:48:52,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:52,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:48:52,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:52,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-19 21:48:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:52,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-19 21:48:52,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:52,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-19 21:48:52,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:52,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-19 21:48:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:52,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-19 21:48:52,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:52,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:48:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:52,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:48:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:52,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-19 21:48:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:52,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-19 21:48:52,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:52,235 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 21:48:52,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:48:52,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770291677] [2024-11-19 21:48:52,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770291677] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:48:52,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [43819350] [2024-11-19 21:48:52,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:48:52,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:48:52,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:48:52,238 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:48:52,240 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 21:48:52,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:52,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 971 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 21:48:52,518 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:48:52,574 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2024-11-19 21:48:52,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:48:52,575 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [43819350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:48:52,575 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:48:52,575 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-19 21:48:52,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635681534] [2024-11-19 21:48:52,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:48:52,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 21:48:52,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:48:52,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 21:48:52,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-19 21:48:52,577 INFO L87 Difference]: Start difference. First operand 377 states and 591 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2024-11-19 21:48:52,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:48:52,638 INFO L93 Difference]: Finished difference Result 743 states and 1171 transitions. [2024-11-19 21:48:52,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 21:48:52,639 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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 111 [2024-11-19 21:48:52,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:48:52,642 INFO L225 Difference]: With dead ends: 743 [2024-11-19 21:48:52,642 INFO L226 Difference]: Without dead ends: 379 [2024-11-19 21:48:52,643 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-19 21:48:52,644 INFO L432 NwaCegarLoop]: 459 mSDtfsCounter, 2 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1819 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 [2024-11-19 21:48:52,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1819 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 21:48:52,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-19 21:48:52,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 379. [2024-11-19 21:48:52,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 297 states have (on average 1.5791245791245792) internal successors, (469), 301 states have internal predecessors, (469), 61 states have call successors, (61), 18 states have call predecessors, (61), 20 states have return successors, (67), 59 states have call predecessors, (67), 60 states have call successors, (67) [2024-11-19 21:48:52,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 597 transitions. [2024-11-19 21:48:52,671 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 597 transitions. Word has length 111 [2024-11-19 21:48:52,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:48:52,671 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 597 transitions. [2024-11-19 21:48:52,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 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) [2024-11-19 21:48:52,672 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 597 transitions. [2024-11-19 21:48:52,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-19 21:48:52,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:48:52,675 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:48:52,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 21:48:52,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:48:52,876 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:48:52,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:48:52,877 INFO L85 PathProgramCache]: Analyzing trace with hash -1498093858, now seen corresponding path program 1 times [2024-11-19 21:48:52,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:48:52,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217926860] [2024-11-19 21:48:52,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:48:52,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:48:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:53,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:48:53,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:53,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:48:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:53,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:48:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:53,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:48:53,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:53,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:48:53,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:53,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-19 21:48:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:53,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-19 21:48:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:53,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-19 21:48:53,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:53,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 21:48:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:53,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:48:53,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:53,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:48:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:53,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-19 21:48:53,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:53,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 21:48:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:53,127 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:48:53,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:48:53,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217926860] [2024-11-19 21:48:53,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217926860] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:48:53,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:48:53,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:48:53,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433775051] [2024-11-19 21:48:53,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:48:53,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:48:53,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:48:53,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:48:53,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:48:53,130 INFO L87 Difference]: Start difference. First operand 379 states and 597 transitions. Second operand has 9 states, 8 states have (on average 8.625) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:48:55,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:48:55,050 INFO L93 Difference]: Finished difference Result 863 states and 1377 transitions. [2024-11-19 21:48:55,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 21:48:55,051 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (16), 6 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 112 [2024-11-19 21:48:55,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:48:55,056 INFO L225 Difference]: With dead ends: 863 [2024-11-19 21:48:55,057 INFO L226 Difference]: Without dead ends: 507 [2024-11-19 21:48:55,060 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-19 21:48:55,061 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 908 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 2113 mSolverCounterSat, 326 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 2439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 326 IncrementalHoareTripleChecker+Valid, 2113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:48:55,061 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 1338 Invalid, 2439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [326 Valid, 2113 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 21:48:55,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2024-11-19 21:48:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 379. [2024-11-19 21:48:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 297 states have (on average 1.5791245791245792) internal successors, (469), 301 states have internal predecessors, (469), 61 states have call successors, (61), 18 states have call predecessors, (61), 20 states have return successors, (66), 59 states have call predecessors, (66), 60 states have call successors, (66) [2024-11-19 21:48:55,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 596 transitions. [2024-11-19 21:48:55,105 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 596 transitions. Word has length 112 [2024-11-19 21:48:55,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:48:55,106 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 596 transitions. [2024-11-19 21:48:55,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.625) internal successors, (69), 5 states have internal predecessors, (69), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:48:55,106 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 596 transitions. [2024-11-19 21:48:55,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 21:48:55,108 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:48:55,109 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:48:55,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 21:48:55,109 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:48:55,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:48:55,109 INFO L85 PathProgramCache]: Analyzing trace with hash -155101294, now seen corresponding path program 2 times [2024-11-19 21:48:55,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:48:55,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [72083227] [2024-11-19 21:48:55,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:48:55,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:48:55,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:55,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:48:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:55,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:48:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:55,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:48:55,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:55,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:48:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:55,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:48:55,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:55,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-19 21:48:55,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:55,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-19 21:48:55,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:55,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-19 21:48:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:55,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:48:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:55,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-19 21:48:55,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:55,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-19 21:48:55,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:55,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-19 21:48:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:55,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-19 21:48:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:55,320 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-19 21:48:55,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:48:55,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [72083227] [2024-11-19 21:48:55,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [72083227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:48:55,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:48:55,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 21:48:55,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225272789] [2024-11-19 21:48:55,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:48:55,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 21:48:55,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:48:55,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 21:48:55,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 21:48:55,323 INFO L87 Difference]: Start difference. First operand 379 states and 596 transitions. Second operand has 9 states, 8 states have (on average 8.75) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:48:57,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:48:57,170 INFO L93 Difference]: Finished difference Result 865 states and 1380 transitions. [2024-11-19 21:48:57,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 21:48:57,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (16), 6 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 113 [2024-11-19 21:48:57,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:48:57,174 INFO L225 Difference]: With dead ends: 865 [2024-11-19 21:48:57,176 INFO L226 Difference]: Without dead ends: 509 [2024-11-19 21:48:57,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-19 21:48:57,178 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 905 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 2131 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 1337 SdHoareTripleChecker+Invalid, 2451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 2131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:48:57,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 1337 Invalid, 2451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 2131 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 21:48:57,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-19 21:48:57,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 381. [2024-11-19 21:48:57,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 298 states have (on average 1.5771812080536913) internal successors, (470), 303 states have internal predecessors, (470), 61 states have call successors, (61), 18 states have call predecessors, (61), 21 states have return successors, (68), 59 states have call predecessors, (68), 60 states have call successors, (68) [2024-11-19 21:48:57,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 599 transitions. [2024-11-19 21:48:57,211 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 599 transitions. Word has length 113 [2024-11-19 21:48:57,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:48:57,213 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 599 transitions. [2024-11-19 21:48:57,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.75) internal successors, (70), 5 states have internal predecessors, (70), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2024-11-19 21:48:57,213 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 599 transitions. [2024-11-19 21:48:57,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-19 21:48:57,215 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:48:57,215 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:48:57,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 21:48:57,216 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:48:57,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:48:57,216 INFO L85 PathProgramCache]: Analyzing trace with hash 625579385, now seen corresponding path program 1 times [2024-11-19 21:48:57,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:48:57,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349839201] [2024-11-19 21:48:57,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:48:57,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:48:57,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:57,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:48:57,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:57,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:48:57,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:57,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:48:57,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:57,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:48:57,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:57,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:48:57,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:57,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:48:57,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:57,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-19 21:48:57,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:57,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-19 21:48:57,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:57,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:48:57,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:57,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-19 21:48:57,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:57,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:48:57,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:57,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:48:57,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:57,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-19 21:48:57,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:57,440 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 21:48:57,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:48:57,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349839201] [2024-11-19 21:48:57,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349839201] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:48:57,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:48:57,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 21:48:57,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142122673] [2024-11-19 21:48:57,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:48:57,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:48:57,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:48:57,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:48:57,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:48:57,443 INFO L87 Difference]: Start difference. First operand 381 states and 599 transitions. Second operand has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-19 21:48:59,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:48:59,828 INFO L93 Difference]: Finished difference Result 863 states and 1375 transitions. [2024-11-19 21:48:59,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 21:48:59,829 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (16), 6 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 [2024-11-19 21:48:59,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:48:59,833 INFO L225 Difference]: With dead ends: 863 [2024-11-19 21:48:59,833 INFO L226 Difference]: Without dead ends: 509 [2024-11-19 21:48:59,835 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-19 21:48:59,835 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 905 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 3581 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 906 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 3899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 3581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:48:59,836 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [906 Valid, 1856 Invalid, 3899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 3581 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 21:48:59,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 509 states. [2024-11-19 21:48:59,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 509 to 381. [2024-11-19 21:48:59,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 298 states have (on average 1.5771812080536913) internal successors, (470), 303 states have internal predecessors, (470), 61 states have call successors, (61), 18 states have call predecessors, (61), 21 states have return successors, (67), 59 states have call predecessors, (67), 60 states have call successors, (67) [2024-11-19 21:48:59,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 598 transitions. [2024-11-19 21:48:59,863 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 598 transitions. Word has length 114 [2024-11-19 21:48:59,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:48:59,864 INFO L471 AbstractCegarLoop]: Abstraction has 381 states and 598 transitions. [2024-11-19 21:48:59,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.7272727272727275) internal successors, (74), 8 states have internal predecessors, (74), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-19 21:48:59,864 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 598 transitions. [2024-11-19 21:48:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 21:48:59,866 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:48:59,866 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:48:59,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 21:48:59,867 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:48:59,867 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:48:59,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1289921317, now seen corresponding path program 2 times [2024-11-19 21:48:59,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:48:59,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15537925] [2024-11-19 21:48:59,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:48:59,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:48:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:48:59,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:48:59,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:00,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:49:00,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:00,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:49:00,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:00,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:49:00,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:00,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:49:00,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:00,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:49:00,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:00,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-19 21:49:00,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:00,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-19 21:49:00,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:00,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:49:00,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:00,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-19 21:49:00,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:00,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:49:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:00,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:49:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:00,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-19 21:49:00,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:00,098 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-19 21:49:00,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:49:00,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15537925] [2024-11-19 21:49:00,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15537925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:49:00,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:49:00,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 21:49:00,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672277495] [2024-11-19 21:49:00,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:49:00,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:49:00,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:49:00,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:49:00,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-19 21:49:00,100 INFO L87 Difference]: Start difference. First operand 381 states and 598 transitions. Second operand has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 8 states have internal predecessors, (75), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-19 21:49:02,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:49:02,262 INFO L93 Difference]: Finished difference Result 865 states and 1381 transitions. [2024-11-19 21:49:02,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 21:49:02,263 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 8 states have internal predecessors, (75), 4 states have call successors, (16), 6 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 115 [2024-11-19 21:49:02,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:49:02,269 INFO L225 Difference]: With dead ends: 865 [2024-11-19 21:49:02,269 INFO L226 Difference]: Without dead ends: 511 [2024-11-19 21:49:02,271 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-19 21:49:02,272 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 901 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 3559 mSolverCounterSat, 324 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 1857 SdHoareTripleChecker+Invalid, 3883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 324 IncrementalHoareTripleChecker+Valid, 3559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:49:02,273 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 1857 Invalid, 3883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [324 Valid, 3559 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-19 21:49:02,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 511 states. [2024-11-19 21:49:02,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 511 to 383. [2024-11-19 21:49:02,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 299 states have (on average 1.5752508361204014) internal successors, (471), 305 states have internal predecessors, (471), 61 states have call successors, (61), 18 states have call predecessors, (61), 22 states have return successors, (72), 59 states have call predecessors, (72), 60 states have call successors, (72) [2024-11-19 21:49:02,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 604 transitions. [2024-11-19 21:49:02,302 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 604 transitions. Word has length 115 [2024-11-19 21:49:02,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:49:02,303 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 604 transitions. [2024-11-19 21:49:02,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.818181818181818) internal successors, (75), 8 states have internal predecessors, (75), 4 states have call successors, (16), 6 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2024-11-19 21:49:02,304 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 604 transitions. [2024-11-19 21:49:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 21:49:02,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:49:02,306 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:49:02,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 21:49:02,306 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:49:02,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:49:02,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1545546924, now seen corresponding path program 1 times [2024-11-19 21:49:02,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:49:02,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [497656796] [2024-11-19 21:49:02,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:49:02,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:49:02,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:02,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:49:02,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:02,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:49:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:02,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:49:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:02,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:49:02,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:02,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:49:02,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:02,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:49:02,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:02,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-19 21:49:02,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:02,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-19 21:49:02,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:02,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 21:49:02,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:02,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-19 21:49:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:02,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-19 21:49:02,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:02,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:49:02,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:02,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-19 21:49:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:02,448 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:49:02,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:49:02,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [497656796] [2024-11-19 21:49:02,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [497656796] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:49:02,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2056917348] [2024-11-19 21:49:02,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:49:02,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:49:02,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:49:02,451 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:49:02,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 21:49:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:02,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 21:49:02,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:49:02,735 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:49:02,735 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 21:49:02,821 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:49:02,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2056917348] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 21:49:02,822 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 21:49:02,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-11-19 21:49:02,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763174804] [2024-11-19 21:49:02,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 21:49:02,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 21:49:02,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:49:02,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 21:49:02,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:49:02,826 INFO L87 Difference]: Start difference. First operand 383 states and 604 transitions. Second operand has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (33), 6 states have call predecessors, (33), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 21:49:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:49:04,665 INFO L93 Difference]: Finished difference Result 1067 states and 1774 transitions. [2024-11-19 21:49:04,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 21:49:04,666 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (33), 6 states have call predecessors, (33), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 116 [2024-11-19 21:49:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:49:04,672 INFO L225 Difference]: With dead ends: 1067 [2024-11-19 21:49:04,672 INFO L226 Difference]: Without dead ends: 953 [2024-11-19 21:49:04,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-19 21:49:04,674 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 1302 mSDsluCounter, 1525 mSDsCounter, 0 mSdLazyCounter, 2268 mSolverCounterSat, 492 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 2760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 492 IncrementalHoareTripleChecker+Valid, 2268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-19 21:49:04,674 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 1779 Invalid, 2760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [492 Valid, 2268 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-19 21:49:04,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2024-11-19 21:49:04,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 801. [2024-11-19 21:49:04,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 801 states, 638 states have (on average 1.6363636363636365) internal successors, (1044), 644 states have internal predecessors, (1044), 140 states have call successors, (140), 18 states have call predecessors, (140), 22 states have return successors, (161), 138 states have call predecessors, (161), 139 states have call successors, (161) [2024-11-19 21:49:04,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 801 states to 801 states and 1345 transitions. [2024-11-19 21:49:04,760 INFO L78 Accepts]: Start accepts. Automaton has 801 states and 1345 transitions. Word has length 116 [2024-11-19 21:49:04,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:49:04,761 INFO L471 AbstractCegarLoop]: Abstraction has 801 states and 1345 transitions. [2024-11-19 21:49:04,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.363636363636363) internal successors, (103), 7 states have internal predecessors, (103), 2 states have call successors, (33), 6 states have call predecessors, (33), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-11-19 21:49:04,761 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 1345 transitions. [2024-11-19 21:49:04,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-19 21:49:04,767 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:49:04,767 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:49:04,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 21:49:04,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:49:04,968 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:49:04,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:49:04,969 INFO L85 PathProgramCache]: Analyzing trace with hash -749441865, now seen corresponding path program 1 times [2024-11-19 21:49:04,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:49:04,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1614566703] [2024-11-19 21:49:04,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:49:04,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:49:04,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:05,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:49:05,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:05,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:49:05,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:05,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:49:05,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:05,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:49:05,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:05,062 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:49:05,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:05,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:49:05,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:05,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-19 21:49:05,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:05,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:49:05,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:05,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:49:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:05,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-19 21:49:05,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:05,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-19 21:49:05,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:05,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-19 21:49:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:05,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-19 21:49:05,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:05,122 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:49:05,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:49:05,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1614566703] [2024-11-19 21:49:05,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1614566703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:49:05,122 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:49:05,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:49:05,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794201032] [2024-11-19 21:49:05,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:49:05,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:49:05,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:49:05,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:49:05,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:49:05,128 INFO L87 Difference]: Start difference. First operand 801 states and 1345 transitions. Second operand has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:49:06,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:49:06,341 INFO L93 Difference]: Finished difference Result 2085 states and 3575 transitions. [2024-11-19 21:49:06,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:49:06,341 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (16), 6 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 [2024-11-19 21:49:06,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:49:06,350 INFO L225 Difference]: With dead ends: 2085 [2024-11-19 21:49:06,350 INFO L226 Difference]: Without dead ends: 1352 [2024-11-19 21:49:06,353 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:49:06,354 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 1033 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 1233 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 1624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 1233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:49:06,354 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 1005 Invalid, 1624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 1233 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 21:49:06,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1352 states. [2024-11-19 21:49:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1352 to 1216. [2024-11-19 21:49:06,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1216 states, 974 states have (on average 1.646817248459959) internal successors, (1604), 980 states have internal predecessors, (1604), 219 states have call successors, (219), 18 states have call predecessors, (219), 22 states have return successors, (250), 217 states have call predecessors, (250), 218 states have call successors, (250) [2024-11-19 21:49:06,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 2073 transitions. [2024-11-19 21:49:06,432 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 2073 transitions. Word has length 122 [2024-11-19 21:49:06,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:49:06,432 INFO L471 AbstractCegarLoop]: Abstraction has 1216 states and 2073 transitions. [2024-11-19 21:49:06,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.0) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:49:06,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 2073 transitions. [2024-11-19 21:49:06,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-19 21:49:06,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:49:06,439 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:49:06,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 21:49:06,439 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:49:06,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:49:06,440 INFO L85 PathProgramCache]: Analyzing trace with hash 780186974, now seen corresponding path program 1 times [2024-11-19 21:49:06,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:49:06,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555785829] [2024-11-19 21:49:06,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:49:06,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:49:06,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:06,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:49:06,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:06,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:49:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:06,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:49:06,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:06,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:49:06,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:06,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:49:06,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:06,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:49:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:06,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-19 21:49:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:06,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:49:06,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:06,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:49:06,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:06,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-19 21:49:06,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:06,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-19 21:49:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:06,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-19 21:49:06,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:06,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-19 21:49:06,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:06,556 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:49:06,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:49:06,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555785829] [2024-11-19 21:49:06,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555785829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:49:06,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:49:06,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:49:06,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054614709] [2024-11-19 21:49:06,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:49:06,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:49:06,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:49:06,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:49:06,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:49:06,558 INFO L87 Difference]: Start difference. First operand 1216 states and 2073 transitions. Second operand has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:49:07,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:49:07,658 INFO L93 Difference]: Finished difference Result 3099 states and 5353 transitions. [2024-11-19 21:49:07,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:49:07,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 6 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 [2024-11-19 21:49:07,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:49:07,669 INFO L225 Difference]: With dead ends: 3099 [2024-11-19 21:49:07,669 INFO L226 Difference]: Without dead ends: 2004 [2024-11-19 21:49:07,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:49:07,673 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 1032 mSDsluCounter, 779 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 391 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1051 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 1612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 391 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:49:07,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1051 Valid, 994 Invalid, 1612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [391 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 21:49:07,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2004 states. [2024-11-19 21:49:07,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2004 to 1868. [2024-11-19 21:49:07,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1868 states, 1507 states have (on average 1.6529528865295289) internal successors, (2491), 1513 states have internal predecessors, (2491), 338 states have call successors, (338), 18 states have call predecessors, (338), 22 states have return successors, (369), 336 states have call predecessors, (369), 337 states have call successors, (369) [2024-11-19 21:49:07,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 3198 transitions. [2024-11-19 21:49:07,754 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 3198 transitions. Word has length 123 [2024-11-19 21:49:07,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:49:07,754 INFO L471 AbstractCegarLoop]: Abstraction has 1868 states and 3198 transitions. [2024-11-19 21:49:07,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.142857142857142) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:49:07,754 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 3198 transitions. [2024-11-19 21:49:07,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 21:49:07,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:49:07,763 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:49:07,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 21:49:07,764 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:49:07,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:49:07,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1999073525, now seen corresponding path program 1 times [2024-11-19 21:49:07,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:49:07,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165808818] [2024-11-19 21:49:07,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:49:07,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:49:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:07,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:49:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:07,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:49:07,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:07,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:49:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:07,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:49:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:07,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:49:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:07,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:49:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:07,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-19 21:49:07,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:07,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:49:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:07,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-19 21:49:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:07,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-19 21:49:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:07,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-19 21:49:07,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:07,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-19 21:49:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:07,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-19 21:49:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:07,882 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:49:07,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:49:07,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165808818] [2024-11-19 21:49:07,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165808818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:49:07,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:49:07,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:49:07,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660526620] [2024-11-19 21:49:07,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:49:07,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:49:07,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:49:07,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:49:07,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:49:07,885 INFO L87 Difference]: Start difference. First operand 1868 states and 3198 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:49:09,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:49:09,003 INFO L93 Difference]: Finished difference Result 4629 states and 8055 transitions. [2024-11-19 21:49:09,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:49:09,003 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (16), 6 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 [2024-11-19 21:49:09,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:49:09,019 INFO L225 Difference]: With dead ends: 4629 [2024-11-19 21:49:09,020 INFO L226 Difference]: Without dead ends: 3007 [2024-11-19 21:49:09,025 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:49:09,026 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 1031 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 387 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1050 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 1602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 387 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-19 21:49:09,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1050 Valid, 981 Invalid, 1602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [387 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-19 21:49:09,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2024-11-19 21:49:09,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 2871. [2024-11-19 21:49:09,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2871 states, 2348 states have (on average 1.658006814310051) internal successors, (3893), 2354 states have internal predecessors, (3893), 500 states have call successors, (500), 18 states have call predecessors, (500), 22 states have return successors, (547), 498 states have call predecessors, (547), 499 states have call successors, (547) [2024-11-19 21:49:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2871 states to 2871 states and 4940 transitions. [2024-11-19 21:49:09,139 INFO L78 Accepts]: Start accepts. Automaton has 2871 states and 4940 transitions. Word has length 124 [2024-11-19 21:49:09,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:49:09,140 INFO L471 AbstractCegarLoop]: Abstraction has 2871 states and 4940 transitions. [2024-11-19 21:49:09,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:49:09,140 INFO L276 IsEmpty]: Start isEmpty. Operand 2871 states and 4940 transitions. [2024-11-19 21:49:09,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 21:49:09,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:49:09,152 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:49:09,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 21:49:09,152 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:49:09,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:49:09,153 INFO L85 PathProgramCache]: Analyzing trace with hash -1077032387, now seen corresponding path program 1 times [2024-11-19 21:49:09,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:49:09,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374196583] [2024-11-19 21:49:09,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:49:09,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:49:09,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:09,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:49:09,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:09,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:49:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:09,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:49:09,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:09,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:49:09,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:09,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:49:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:09,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:49:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:09,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-19 21:49:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:09,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 21:49:09,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:09,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-19 21:49:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:09,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-19 21:49:09,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:09,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:49:09,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:09,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-19 21:49:09,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:09,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-19 21:49:09,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:09,259 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:49:09,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:49:09,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374196583] [2024-11-19 21:49:09,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374196583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:49:09,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:49:09,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:49:09,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319167118] [2024-11-19 21:49:09,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:49:09,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:49:09,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:49:09,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:49:09,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:49:09,260 INFO L87 Difference]: Start difference. First operand 2871 states and 4940 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:49:10,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:49:10,537 INFO L93 Difference]: Finished difference Result 7053 states and 12344 transitions. [2024-11-19 21:49:10,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:49:10,538 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (16), 6 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 [2024-11-19 21:49:10,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:49:10,565 INFO L225 Difference]: With dead ends: 7053 [2024-11-19 21:49:10,565 INFO L226 Difference]: Without dead ends: 4632 [2024-11-19 21:49:10,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:49:10,578 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 1027 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1221 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 1599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 1221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:49:10,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 982 Invalid, 1599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 1221 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 21:49:10,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4632 states. [2024-11-19 21:49:10,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4632 to 4496. [2024-11-19 21:49:10,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4496 states, 3728 states have (on average 1.661480686695279) internal successors, (6194), 3734 states have internal predecessors, (6194), 745 states have call successors, (745), 18 states have call predecessors, (745), 22 states have return successors, (818), 743 states have call predecessors, (818), 744 states have call successors, (818) [2024-11-19 21:49:10,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4496 states to 4496 states and 7757 transitions. [2024-11-19 21:49:10,826 INFO L78 Accepts]: Start accepts. Automaton has 4496 states and 7757 transitions. Word has length 125 [2024-11-19 21:49:10,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:49:10,830 INFO L471 AbstractCegarLoop]: Abstraction has 4496 states and 7757 transitions. [2024-11-19 21:49:10,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:49:10,831 INFO L276 IsEmpty]: Start isEmpty. Operand 4496 states and 7757 transitions. [2024-11-19 21:49:10,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 21:49:10,870 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:49:10,871 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:49:10,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 21:49:10,872 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:49:10,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:49:10,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1902792871, now seen corresponding path program 1 times [2024-11-19 21:49:10,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:49:10,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107222178] [2024-11-19 21:49:10,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:49:10,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:49:10,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:10,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:49:10,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:10,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:49:10,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:10,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:49:10,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:10,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:49:10,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:10,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:49:10,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:10,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:49:11,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:11,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-19 21:49:11,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:11,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 21:49:11,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:11,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-19 21:49:11,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:11,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-19 21:49:11,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:11,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:49:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:11,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-19 21:49:11,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:11,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-19 21:49:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:11,025 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:49:11,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:49:11,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107222178] [2024-11-19 21:49:11,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107222178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:49:11,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:49:11,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:49:11,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953950572] [2024-11-19 21:49:11,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:49:11,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:49:11,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:49:11,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:49:11,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:49:11,027 INFO L87 Difference]: Start difference. First operand 4496 states and 7757 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:49:12,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:49:12,349 INFO L93 Difference]: Finished difference Result 11099 states and 19504 transitions. [2024-11-19 21:49:12,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:49:12,349 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 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 [2024-11-19 21:49:12,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:49:12,387 INFO L225 Difference]: With dead ends: 11099 [2024-11-19 21:49:12,387 INFO L226 Difference]: Without dead ends: 7365 [2024-11-19 21:49:12,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:49:12,399 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 1025 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1043 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 1667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:49:12,400 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1043 Valid, 1048 Invalid, 1667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 21:49:12,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7365 states. [2024-11-19 21:49:12,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7365 to 7229. [2024-11-19 21:49:12,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7229 states, 5968 states have (on average 1.6586796246648794) internal successors, (9899), 5974 states have internal predecessors, (9899), 1238 states have call successors, (1238), 18 states have call predecessors, (1238), 22 states have return successors, (1355), 1236 states have call predecessors, (1355), 1237 states have call successors, (1355) [2024-11-19 21:49:12,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7229 states to 7229 states and 12492 transitions. [2024-11-19 21:49:12,700 INFO L78 Accepts]: Start accepts. Automaton has 7229 states and 12492 transitions. Word has length 126 [2024-11-19 21:49:12,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:49:12,700 INFO L471 AbstractCegarLoop]: Abstraction has 7229 states and 12492 transitions. [2024-11-19 21:49:12,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:49:12,701 INFO L276 IsEmpty]: Start isEmpty. Operand 7229 states and 12492 transitions. [2024-11-19 21:49:12,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-19 21:49:12,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:49:12,722 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:49:12,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 21:49:12,722 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:49:12,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:49:12,723 INFO L85 PathProgramCache]: Analyzing trace with hash 209525721, now seen corresponding path program 1 times [2024-11-19 21:49:12,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:49:12,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792916097] [2024-11-19 21:49:12,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:49:12,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:49:12,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:12,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:49:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:12,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:49:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:12,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:49:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:12,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:49:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:12,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:49:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:12,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:49:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:12,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-19 21:49:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:12,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:49:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:12,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-19 21:49:12,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:12,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-19 21:49:12,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:12,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-19 21:49:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:12,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-19 21:49:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:12,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-19 21:49:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:12,868 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:49:12,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:49:12,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792916097] [2024-11-19 21:49:12,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792916097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:49:12,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:49:12,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:49:12,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349616838] [2024-11-19 21:49:12,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:49:12,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:49:12,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:49:12,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:49:12,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:49:12,870 INFO L87 Difference]: Start difference. First operand 7229 states and 12492 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:49:14,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:49:14,230 INFO L93 Difference]: Finished difference Result 18434 states and 32388 transitions. [2024-11-19 21:49:14,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:49:14,231 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 6 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 [2024-11-19 21:49:14,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:49:14,287 INFO L225 Difference]: With dead ends: 18434 [2024-11-19 21:49:14,288 INFO L226 Difference]: Without dead ends: 12344 [2024-11-19 21:49:14,314 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:49:14,314 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 1024 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:49:14,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 984 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 21:49:14,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12344 states. [2024-11-19 21:49:14,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12344 to 12208. [2024-11-19 21:49:14,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12208 states, 10125 states have (on average 1.6581728395061728) internal successors, (16789), 10131 states have internal predecessors, (16789), 2060 states have call successors, (2060), 18 states have call predecessors, (2060), 22 states have return successors, (2255), 2058 states have call predecessors, (2255), 2059 states have call successors, (2255) [2024-11-19 21:49:14,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12208 states to 12208 states and 21104 transitions. [2024-11-19 21:49:14,816 INFO L78 Accepts]: Start accepts. Automaton has 12208 states and 21104 transitions. Word has length 127 [2024-11-19 21:49:14,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:49:14,816 INFO L471 AbstractCegarLoop]: Abstraction has 12208 states and 21104 transitions. [2024-11-19 21:49:14,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:49:14,818 INFO L276 IsEmpty]: Start isEmpty. Operand 12208 states and 21104 transitions. [2024-11-19 21:49:14,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-19 21:49:14,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:49:14,844 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:49:14,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 21:49:14,844 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:49:14,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:49:14,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1718414795, now seen corresponding path program 1 times [2024-11-19 21:49:14,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:49:14,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799730310] [2024-11-19 21:49:14,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:49:14,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:49:14,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:14,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:49:14,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:14,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:49:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:14,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:49:14,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:14,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:49:14,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:14,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:49:14,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:14,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:49:14,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:14,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-19 21:49:14,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:14,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-19 21:49:14,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:14,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-19 21:49:14,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:14,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-19 21:49:14,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:14,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-19 21:49:14,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:14,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-19 21:49:14,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:14,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-19 21:49:14,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:14,953 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:49:14,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:49:14,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799730310] [2024-11-19 21:49:14,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799730310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:49:14,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:49:14,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:49:14,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118888506] [2024-11-19 21:49:14,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:49:14,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:49:14,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:49:14,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:49:14,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:49:14,957 INFO L87 Difference]: Start difference. First operand 12208 states and 21104 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:49:16,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:49:16,325 INFO L93 Difference]: Finished difference Result 29392 states and 51353 transitions. [2024-11-19 21:49:16,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:49:16,326 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 6 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 [2024-11-19 21:49:16,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:49:16,413 INFO L225 Difference]: With dead ends: 29392 [2024-11-19 21:49:16,413 INFO L226 Difference]: Without dead ends: 19297 [2024-11-19 21:49:16,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:49:16,458 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 1021 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 1216 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 1216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:49:16,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 957 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 1216 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 21:49:16,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19297 states. [2024-11-19 21:49:17,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19297 to 19161. [2024-11-19 21:49:17,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19161 states, 15875 states have (on average 1.6334488188976377) internal successors, (25931), 15881 states have internal predecessors, (25931), 3263 states have call successors, (3263), 18 states have call predecessors, (3263), 22 states have return successors, (3602), 3261 states have call predecessors, (3602), 3262 states have call successors, (3602) [2024-11-19 21:49:17,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19161 states to 19161 states and 32796 transitions. [2024-11-19 21:49:17,421 INFO L78 Accepts]: Start accepts. Automaton has 19161 states and 32796 transitions. Word has length 128 [2024-11-19 21:49:17,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:49:17,422 INFO L471 AbstractCegarLoop]: Abstraction has 19161 states and 32796 transitions. [2024-11-19 21:49:17,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:49:17,422 INFO L276 IsEmpty]: Start isEmpty. Operand 19161 states and 32796 transitions. [2024-11-19 21:49:17,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 21:49:17,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:49:17,456 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:49:17,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 21:49:17,457 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:49:17,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:49:17,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1529621608, now seen corresponding path program 1 times [2024-11-19 21:49:17,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:49:17,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102364387] [2024-11-19 21:49:17,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:49:17,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:49:17,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:17,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:49:17,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:17,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:49:17,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:17,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:49:17,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:17,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:49:17,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:17,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:49:17,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:17,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:49:17,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:17,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-19 21:49:17,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:17,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-19 21:49:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:17,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-19 21:49:17,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:17,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-19 21:49:17,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:17,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-19 21:49:17,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:17,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-19 21:49:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:17,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-19 21:49:17,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:17,605 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:49:17,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:49:17,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102364387] [2024-11-19 21:49:17,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102364387] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:49:17,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:49:17,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:49:17,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431176997] [2024-11-19 21:49:17,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:49:17,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:49:17,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:49:17,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:49:17,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:49:17,608 INFO L87 Difference]: Start difference. First operand 19161 states and 32796 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:49:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:49:19,440 INFO L93 Difference]: Finished difference Result 50824 states and 88473 transitions. [2024-11-19 21:49:19,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:49:19,440 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 6 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 [2024-11-19 21:49:19,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:49:19,576 INFO L225 Difference]: With dead ends: 50824 [2024-11-19 21:49:19,576 INFO L226 Difference]: Without dead ends: 34418 [2024-11-19 21:49:19,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:49:19,624 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 1020 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 1603 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 397 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-19 21:49:19,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1038 Valid, 982 Invalid, 1603 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [397 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-19 21:49:19,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34418 states. [2024-11-19 21:49:20,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34418 to 34282. [2024-11-19 21:49:20,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34282 states, 28546 states have (on average 1.6301408253345477) internal successors, (46534), 28552 states have internal predecessors, (46534), 5713 states have call successors, (5713), 18 states have call predecessors, (5713), 22 states have return successors, (6326), 5711 states have call predecessors, (6326), 5712 states have call successors, (6326) [2024-11-19 21:49:21,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34282 states to 34282 states and 58573 transitions. [2024-11-19 21:49:21,036 INFO L78 Accepts]: Start accepts. Automaton has 34282 states and 58573 transitions. Word has length 129 [2024-11-19 21:49:21,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:49:21,037 INFO L471 AbstractCegarLoop]: Abstraction has 34282 states and 58573 transitions. [2024-11-19 21:49:21,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:49:21,037 INFO L276 IsEmpty]: Start isEmpty. Operand 34282 states and 58573 transitions. [2024-11-19 21:49:21,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-19 21:49:21,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:49:21,067 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:49:21,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-19 21:49:21,067 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:49:21,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:49:21,068 INFO L85 PathProgramCache]: Analyzing trace with hash 779560849, now seen corresponding path program 1 times [2024-11-19 21:49:21,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:49:21,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1918148338] [2024-11-19 21:49:21,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:49:21,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:49:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:21,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:49:21,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:21,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:49:21,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:21,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:49:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:21,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:49:21,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:21,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:49:21,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:21,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:49:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:21,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-19 21:49:21,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:21,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-19 21:49:21,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:21,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-19 21:49:21,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:21,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-19 21:49:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:21,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-19 21:49:21,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:21,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-19 21:49:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:21,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-19 21:49:21,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:21,398 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:49:21,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:49:21,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1918148338] [2024-11-19 21:49:21,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1918148338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:49:21,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:49:21,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:49:21,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088024959] [2024-11-19 21:49:21,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:49:21,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:49:21,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:49:21,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:49:21,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:49:21,404 INFO L87 Difference]: Start difference. First operand 34282 states and 58573 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:49:24,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:49:24,104 INFO L93 Difference]: Finished difference Result 93696 states and 162267 transitions. [2024-11-19 21:49:24,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:49:24,105 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 6 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 [2024-11-19 21:49:24,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:49:24,373 INFO L225 Difference]: With dead ends: 93696 [2024-11-19 21:49:24,373 INFO L226 Difference]: Without dead ends: 63085 [2024-11-19 21:49:24,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:49:24,457 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 1020 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1200 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1039 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 1596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 21:49:24,457 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1039 Valid, 982 Invalid, 1596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1200 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 21:49:24,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63085 states. [2024-11-19 21:49:27,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63085 to 62949. [2024-11-19 21:49:27,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62949 states, 52700 states have (on average 1.6259013282732449) internal successors, (85685), 52706 states have internal predecessors, (85685), 10226 states have call successors, (10226), 18 states have call predecessors, (10226), 22 states have return successors, (11371), 10224 states have call predecessors, (11371), 10225 states have call successors, (11371) [2024-11-19 21:49:27,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62949 states to 62949 states and 107282 transitions. [2024-11-19 21:49:27,510 INFO L78 Accepts]: Start accepts. Automaton has 62949 states and 107282 transitions. Word has length 130 [2024-11-19 21:49:27,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:49:27,512 INFO L471 AbstractCegarLoop]: Abstraction has 62949 states and 107282 transitions. [2024-11-19 21:49:27,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:49:27,513 INFO L276 IsEmpty]: Start isEmpty. Operand 62949 states and 107282 transitions. [2024-11-19 21:49:27,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 21:49:27,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:49:27,553 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:49:27,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-19 21:49:27,554 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:49:27,554 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:49:27,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1428508584, now seen corresponding path program 1 times [2024-11-19 21:49:27,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:49:27,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664202288] [2024-11-19 21:49:27,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:49:27,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:49:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:27,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:49:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:27,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:49:27,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:27,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:49:27,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:27,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:49:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:27,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:49:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:27,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:49:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:27,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-19 21:49:27,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:27,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-19 21:49:27,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:27,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-19 21:49:27,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:27,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-19 21:49:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:27,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-19 21:49:27,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:27,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-19 21:49:27,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:27,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-19 21:49:27,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:27,678 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:49:27,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:49:27,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664202288] [2024-11-19 21:49:27,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664202288] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:49:27,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:49:27,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 21:49:27,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236432423] [2024-11-19 21:49:27,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:49:27,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 21:49:27,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:49:27,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 21:49:27,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 21:49:27,681 INFO L87 Difference]: Start difference. First operand 62949 states and 107282 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:49:31,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:49:31,077 INFO L93 Difference]: Finished difference Result 118072 states and 204901 transitions. [2024-11-19 21:49:31,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 21:49:31,078 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 6 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 131 [2024-11-19 21:49:31,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:49:31,615 INFO L225 Difference]: With dead ends: 118072 [2024-11-19 21:49:31,615 INFO L226 Difference]: Without dead ends: 117958 [2024-11-19 21:49:31,680 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-11-19 21:49:31,681 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 1012 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 1222 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1029 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 1222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:49:31,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1029 Valid, 991 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 1222 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 21:49:31,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117958 states. [2024-11-19 21:49:35,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117958 to 117822. [2024-11-19 21:49:35,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117822 states, 99205 states have (on average 1.6206441207600424) internal successors, (160776), 99211 states have internal predecessors, (160776), 18594 states have call successors, (18594), 18 states have call predecessors, (18594), 22 states have return successors, (20785), 18592 states have call predecessors, (20785), 18593 states have call successors, (20785) [2024-11-19 21:49:35,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117822 states to 117822 states and 200155 transitions. [2024-11-19 21:49:35,875 INFO L78 Accepts]: Start accepts. Automaton has 117822 states and 200155 transitions. Word has length 131 [2024-11-19 21:49:35,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:49:35,875 INFO L471 AbstractCegarLoop]: Abstraction has 117822 states and 200155 transitions. [2024-11-19 21:49:35,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 6 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2024-11-19 21:49:35,875 INFO L276 IsEmpty]: Start isEmpty. Operand 117822 states and 200155 transitions. [2024-11-19 21:49:35,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 21:49:35,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:49:35,908 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:49:35,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-19 21:49:35,908 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:49:35,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:49:35,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1242607790, now seen corresponding path program 1 times [2024-11-19 21:49:35,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:49:35,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189135458] [2024-11-19 21:49:35,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:49:35,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:49:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:36,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:49:36,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:36,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:49:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:36,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:49:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:36,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:49:36,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:36,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:49:36,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:36,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:49:36,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:36,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:49:36,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:36,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:49:36,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:36,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:49:36,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:36,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:49:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:36,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-19 21:49:36,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:36,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-19 21:49:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:36,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-19 21:49:36,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-19 21:49:36,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:49:36,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189135458] [2024-11-19 21:49:36,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189135458] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 21:49:36,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2121284985] [2024-11-19 21:49:36,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:49:36,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:49:36,414 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 21:49:36,416 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 21:49:36,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 21:49:36,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:36,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-19 21:49:36,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 21:49:37,354 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 21:49:37,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 21:49:37,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2121284985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:49:37,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 21:49:37,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [19] total 29 [2024-11-19 21:49:37,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484856618] [2024-11-19 21:49:37,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:49:37,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 21:49:37,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:49:37,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 21:49:37,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2024-11-19 21:49:37,358 INFO L87 Difference]: Start difference. First operand 117822 states and 200155 transitions. Second operand has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 10 states have internal predecessors, (97), 5 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-19 21:49:39,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:49:39,829 INFO L93 Difference]: Finished difference Result 118077 states and 200519 transitions. [2024-11-19 21:49:39,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 21:49:39,830 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 10 states have internal predecessors, (97), 5 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) Word has length 132 [2024-11-19 21:49:39,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:49:40,433 INFO L225 Difference]: With dead ends: 118077 [2024-11-19 21:49:40,434 INFO L226 Difference]: Without dead ends: 117969 [2024-11-19 21:49:40,510 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=186, Invalid=1536, Unknown=0, NotChecked=0, Total=1722 [2024-11-19 21:49:40,512 INFO L432 NwaCegarLoop]: 504 mSDtfsCounter, 633 mSDsluCounter, 4014 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 4518 SdHoareTripleChecker+Invalid, 532 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:49:40,513 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 4518 Invalid, 532 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 21:49:40,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117969 states. [2024-11-19 21:49:44,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117969 to 117947. [2024-11-19 21:49:44,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117947 states, 99301 states have (on average 1.6204368536067109) internal successors, (160911), 99308 states have internal predecessors, (160911), 18611 states have call successors, (18611), 28 states have call predecessors, (18611), 34 states have return successors, (20812), 18610 states have call predecessors, (20812), 18609 states have call successors, (20812) [2024-11-19 21:49:45,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117947 states to 117947 states and 200334 transitions. [2024-11-19 21:49:45,412 INFO L78 Accepts]: Start accepts. Automaton has 117947 states and 200334 transitions. Word has length 132 [2024-11-19 21:49:45,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:49:45,417 INFO L471 AbstractCegarLoop]: Abstraction has 117947 states and 200334 transitions. [2024-11-19 21:49:45,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.818181818181818) internal successors, (97), 10 states have internal predecessors, (97), 5 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 6 states have call predecessors, (13), 5 states have call successors, (13) [2024-11-19 21:49:45,421 INFO L276 IsEmpty]: Start isEmpty. Operand 117947 states and 200334 transitions. [2024-11-19 21:49:45,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 21:49:45,503 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 21:49:45,504 INFO L215 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:49:45,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 21:49:45,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 21:49:45,706 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 21:49:45,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 21:49:45,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1876719211, now seen corresponding path program 1 times [2024-11-19 21:49:45,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 21:49:45,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988016344] [2024-11-19 21:49:45,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 21:49:45,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 21:49:45,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:45,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-19 21:49:45,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:45,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-19 21:49:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:45,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-19 21:49:45,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:45,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-19 21:49:45,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:45,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-19 21:49:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:45,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-19 21:49:45,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:45,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-19 21:49:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:45,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-19 21:49:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:45,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-19 21:49:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:45,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-19 21:49:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:45,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-19 21:49:45,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:45,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-19 21:49:45,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:45,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-19 21:49:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 21:49:45,920 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-19 21:49:45,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 21:49:45,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988016344] [2024-11-19 21:49:45,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988016344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 21:49:45,921 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 21:49:45,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 21:49:45,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899827608] [2024-11-19 21:49:45,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 21:49:45,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 21:49:45,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 21:49:45,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 21:49:45,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-19 21:49:45,923 INFO L87 Difference]: Start difference. First operand 117947 states and 200334 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 21:49:49,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 21:49:49,467 INFO L93 Difference]: Finished difference Result 118182 states and 204022 transitions. [2024-11-19 21:49:49,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 21:49:49,467 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) Word has length 133 [2024-11-19 21:49:49,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 21:49:49,504 INFO L225 Difference]: With dead ends: 118182 [2024-11-19 21:49:49,504 INFO L226 Difference]: Without dead ends: 0 [2024-11-19 21:49:49,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=501, Unknown=0, NotChecked=0, Total=650 [2024-11-19 21:49:49,914 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 916 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 2956 mSolverCounterSat, 293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 3249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 293 IncrementalHoareTripleChecker+Valid, 2956 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-19 21:49:49,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 1680 Invalid, 3249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [293 Valid, 2956 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-19 21:49:49,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-19 21:49:49,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-19 21:49:49,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 21:49:49,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-19 21:49:49,940 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 133 [2024-11-19 21:49:49,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 21:49:49,941 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-19 21:49:49,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 6 states have internal predecessors, (88), 1 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 1 states have call successors, (13) [2024-11-19 21:49:49,941 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-19 21:49:49,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-19 21:49:49,944 INFO L782 garLoopResultBuilder]: Registering result SAFE for location outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 21:49:49,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-19 21:49:49,948 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 21:49:49,950 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.