./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_product25.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/product-lines/email_spec27_product25.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c862f9fbd969695db1625134466cee856e407b57f937740cfce5c982a0b9c02a --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:40:47,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:40:47,159 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:40:47,162 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:40:47,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:40:47,183 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:40:47,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:40:47,184 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:40:47,184 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:40:47,185 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:40:47,185 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:40:47,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:40:47,186 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:40:47,187 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:40:47,188 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:40:47,188 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:40:47,188 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:40:47,188 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:40:47,189 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:40:47,189 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:40:47,189 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:40:47,190 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:40:47,190 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:40:47,190 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:40:47,190 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:40:47,190 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:40:47,191 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:40:47,191 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:40:47,191 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:40:47,191 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:40:47,191 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:40:47,192 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:40:47,192 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:40:47,192 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:40:47,192 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:40:47,192 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:40:47,192 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:40:47,193 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:40:47,193 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:40:47,193 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:40:47,193 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:40:47,193 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:40:47,194 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 -> c862f9fbd969695db1625134466cee856e407b57f937740cfce5c982a0b9c02a [2024-11-11 20:40:47,374 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:40:47,395 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:40:47,396 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:40:47,397 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:40:47,398 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:40:47,398 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_product25.cil.c [2024-11-11 20:40:48,605 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:40:48,821 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:40:48,823 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product25.cil.c [2024-11-11 20:40:48,838 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddf6c2ce9/b177cfca7b104d66bdb02a57f01cc70d/FLAGc76c78cf3 [2024-11-11 20:40:49,147 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ddf6c2ce9/b177cfca7b104d66bdb02a57f01cc70d [2024-11-11 20:40:49,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:40:49,150 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:40:49,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:40:49,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:40:49,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:40:49,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:40:49" (1/1) ... [2024-11-11 20:40:49,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6380b705 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:49, skipping insertion in model container [2024-11-11 20:40:49,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:40:49" (1/1) ... [2024-11-11 20:40:49,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:40:49,646 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product25.cil.c[58911,58924] [2024-11-11 20:40:49,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:40:49,678 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:40:49,685 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [48] [2024-11-11 20:40:49,686 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [418] [2024-11-11 20:40:49,686 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1490] [2024-11-11 20:40:49,686 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1588] [2024-11-11 20:40:49,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1989] [2024-11-11 20:40:49,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2006] [2024-11-11 20:40:49,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [2235] [2024-11-11 20:40:49,687 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2267] [2024-11-11 20:40:49,688 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2633] [2024-11-11 20:40:49,688 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2642] [2024-11-11 20:40:49,688 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2933] [2024-11-11 20:40:49,756 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_product25.cil.c[58911,58924] [2024-11-11 20:40:49,767 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:40:49,797 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:40:49,797 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:49 WrapperNode [2024-11-11 20:40:49,797 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:40:49,798 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:40:49,798 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:40:49,798 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:40:49,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:49" (1/1) ... [2024-11-11 20:40:49,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:49" (1/1) ... [2024-11-11 20:40:49,867 INFO L138 Inliner]: procedures = 130, calls = 201, calls flagged for inlining = 59, calls inlined = 56, statements flattened = 1033 [2024-11-11 20:40:49,868 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:40:49,868 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:40:49,868 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:40:49,869 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:40:49,884 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:49" (1/1) ... [2024-11-11 20:40:49,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:49" (1/1) ... [2024-11-11 20:40:49,889 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:49" (1/1) ... [2024-11-11 20:40:49,915 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-11 20:40:49,915 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:49" (1/1) ... [2024-11-11 20:40:49,915 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:49" (1/1) ... [2024-11-11 20:40:49,932 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:49" (1/1) ... [2024-11-11 20:40:49,943 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:49" (1/1) ... [2024-11-11 20:40:49,952 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:49" (1/1) ... [2024-11-11 20:40:49,956 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:49" (1/1) ... [2024-11-11 20:40:49,962 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:40:49,963 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:40:49,963 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:40:49,966 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:40:49,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:49" (1/1) ... [2024-11-11 20:40:49,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:40:49,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:40:50,002 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-11 20:40:50,004 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-11 20:40:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2024-11-11 20:40:50,043 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2024-11-11 20:40:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2024-11-11 20:40:50,043 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2024-11-11 20:40:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__Keys [2024-11-11 20:40:50,043 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__Keys [2024-11-11 20:40:50,043 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-11 20:40:50,044 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-11 20:40:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-11 20:40:50,044 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-11 20:40:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-11 20:40:50,044 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-11 20:40:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-11 20:40:50,044 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-11 20:40:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-11 20:40:50,044 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-11 20:40:50,044 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-11 20:40:50,044 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-11 20:40:50,045 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-11 20:40:50,045 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-11 20:40:50,045 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-11 20:40:50,045 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-11 20:40:50,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:40:50,045 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-11 20:40:50,045 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-11 20:40:50,045 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2024-11-11 20:40:50,045 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2024-11-11 20:40:50,045 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-11 20:40:50,045 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-11 20:40:50,045 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-11 20:40:50,045 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-11 20:40:50,046 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-11 20:40:50,046 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-11 20:40:50,046 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2024-11-11 20:40:50,046 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2024-11-11 20:40:50,046 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-11 20:40:50,046 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-11 20:40:50,046 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-11 20:40:50,046 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-11 20:40:50,046 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-11 20:40:50,046 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-11 20:40:50,046 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-11 20:40:50,046 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-11 20:40:50,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:40:50,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:40:50,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:40:50,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:40:50,047 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-11 20:40:50,047 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-11 20:40:50,047 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2024-11-11 20:40:50,048 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2024-11-11 20:40:50,048 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:40:50,048 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:40:50,231 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:40:50,233 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:40:51,015 INFO L? ?]: Removed 537 outVars from TransFormulas that were not future-live. [2024-11-11 20:40:51,015 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:40:51,074 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:40:51,075 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:40:51,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:40:51 BoogieIcfgContainer [2024-11-11 20:40:51,075 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:40:51,084 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:40:51,084 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:40:51,087 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:40:51,087 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:40:49" (1/3) ... [2024-11-11 20:40:51,087 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660850a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:40:51, skipping insertion in model container [2024-11-11 20:40:51,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:40:49" (2/3) ... [2024-11-11 20:40:51,088 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@660850a2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:40:51, skipping insertion in model container [2024-11-11 20:40:51,088 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:40:51" (3/3) ... [2024-11-11 20:40:51,089 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec27_product25.cil.c [2024-11-11 20:40:51,101 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:40:51,102 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:40:51,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:40:51,210 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;@4384943e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:40:51,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:40:51,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 392 states, 309 states have (on average 1.5598705501618122) internal successors, (482), 312 states have internal predecessors, (482), 58 states have call successors, (58), 23 states have call predecessors, (58), 23 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2024-11-11 20:40:51,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-11 20:40:51,229 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:51,230 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:51,230 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:51,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:51,234 INFO L85 PathProgramCache]: Analyzing trace with hash 596273931, now seen corresponding path program 1 times [2024-11-11 20:40:51,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:51,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110061752] [2024-11-11 20:40:51,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:51,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:51,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:51,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:51,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:51,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:51,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:51,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:51,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:40:51,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:51,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:40:51,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:51,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:40:51,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:51,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:40:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:51,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 20:40:51,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:51,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 20:40:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:51,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:40:51,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:51,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:40:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:51,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:40:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:51,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:40:51,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:51,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:40:51,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:51,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:40:51,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:51,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:40:51,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:51,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 20:40:51,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:51,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 20:40:51,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:51,810 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:51,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:51,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110061752] [2024-11-11 20:40:51,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110061752] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:40:51,812 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [997438219] [2024-11-11 20:40:51,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:51,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:51,812 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:40:51,814 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-11 20:40:51,819 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-11 20:40:52,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:52,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 1173 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 20:40:52,127 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:40:52,145 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-11 20:40:52,145 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:40:52,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [997438219] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:52,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:40:52,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-11 20:40:52,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644262012] [2024-11-11 20:40:52,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:52,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:40:52,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:52,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:40:52,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:40:52,183 INFO L87 Difference]: Start difference. First operand has 392 states, 309 states have (on average 1.5598705501618122) internal successors, (482), 312 states have internal predecessors, (482), 58 states have call successors, (58), 23 states have call predecessors, (58), 23 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) Second operand has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-11 20:40:52,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:52,243 INFO L93 Difference]: Finished difference Result 591 states and 886 transitions. [2024-11-11 20:40:52,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:40:52,247 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 136 [2024-11-11 20:40:52,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:52,261 INFO L225 Difference]: With dead ends: 591 [2024-11-11 20:40:52,261 INFO L226 Difference]: Without dead ends: 385 [2024-11-11 20:40:52,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 168 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-11 20:40:52,270 INFO L435 NwaCegarLoop]: 594 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, 594 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-11 20:40:52,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:40:52,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2024-11-11 20:40:52,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 385. [2024-11-11 20:40:52,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 303 states have (on average 1.5544554455445545) internal successors, (471), 305 states have internal predecessors, (471), 58 states have call successors, (58), 23 states have call predecessors, (58), 23 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-11 20:40:52,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 586 transitions. [2024-11-11 20:40:52,333 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 586 transitions. Word has length 136 [2024-11-11 20:40:52,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:52,334 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 586 transitions. [2024-11-11 20:40:52,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 38.0) internal successors, (76), 2 states have internal predecessors, (76), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-11 20:40:52,334 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 586 transitions. [2024-11-11 20:40:52,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-11 20:40:52,337 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:52,337 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:52,353 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-11 20:40:52,538 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-11 20:40:52,538 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:52,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:52,539 INFO L85 PathProgramCache]: Analyzing trace with hash 779485398, now seen corresponding path program 1 times [2024-11-11 20:40:52,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:52,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007040925] [2024-11-11 20:40:52,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:52,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:52,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:52,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:52,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:52,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:52,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:52,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:52,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:40:52,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:52,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:40:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:52,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:40:52,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:52,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:40:52,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:52,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:40:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:52,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:40:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:52,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:40:52,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:52,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:40:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:52,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:40:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:52,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:40:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:52,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:40:52,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:52,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:40:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:52,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:40:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:52,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:40:52,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:52,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-11 20:40:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:52,757 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:52,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:52,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007040925] [2024-11-11 20:40:52,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007040925] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:40:52,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [259046194] [2024-11-11 20:40:52,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:52,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:52,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:40:52,762 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-11 20:40:52,763 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-11 20:40:53,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:53,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 1174 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:40:53,025 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:40:53,053 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2024-11-11 20:40:53,056 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:40:53,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [259046194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:53,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:40:53,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:40:53,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717387271] [2024-11-11 20:40:53,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:53,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:40:53,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:53,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:40:53,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:40:53,060 INFO L87 Difference]: Start difference. First operand 385 states and 586 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-11 20:40:53,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:53,110 INFO L93 Difference]: Finished difference Result 581 states and 864 transitions. [2024-11-11 20:40:53,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:40:53,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 137 [2024-11-11 20:40:53,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:53,114 INFO L225 Difference]: With dead ends: 581 [2024-11-11 20:40:53,114 INFO L226 Difference]: Without dead ends: 388 [2024-11-11 20:40:53,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 168 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-11 20:40:53,115 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 1 mSDsluCounter, 582 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1166 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-11 20:40:53,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1166 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:40:53,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2024-11-11 20:40:53,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 387. [2024-11-11 20:40:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 305 states have (on average 1.5508196721311476) internal successors, (473), 307 states have internal predecessors, (473), 58 states have call successors, (58), 23 states have call predecessors, (58), 23 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2024-11-11 20:40:53,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 588 transitions. [2024-11-11 20:40:53,140 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 588 transitions. Word has length 137 [2024-11-11 20:40:53,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:53,141 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 588 transitions. [2024-11-11 20:40:53,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-11 20:40:53,142 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 588 transitions. [2024-11-11 20:40:53,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-11 20:40:53,144 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:53,144 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:53,165 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-11 20:40:53,345 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-11 20:40:53,346 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:53,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:53,346 INFO L85 PathProgramCache]: Analyzing trace with hash -1778661451, now seen corresponding path program 1 times [2024-11-11 20:40:53,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:53,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254594240] [2024-11-11 20:40:53,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:53,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:53,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:53,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:53,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:53,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:53,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:53,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:53,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:53,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:40:53,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:53,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:40:53,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:53,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:40:53,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:53,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 20:40:53,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:53,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:40:53,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:53,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:40:53,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:53,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:40:53,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:53,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:40:53,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:53,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:40:53,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:53,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:40:53,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:53,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:40:53,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:53,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:40:53,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:53,557 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:40:53,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:53,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254594240] [2024-11-11 20:40:53,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254594240] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:40:53,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430414366] [2024-11-11 20:40:53,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:53,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:53,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:40:53,560 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-11 20:40:53,561 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-11 20:40:53,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:53,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:40:53,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:40:53,853 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:40:53,853 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:40:53,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430414366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:53,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:40:53,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:40:53,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828701164] [2024-11-11 20:40:53,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:53,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:40:53,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:53,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:40:53,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:40:53,856 INFO L87 Difference]: Start difference. First operand 387 states and 588 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:40:53,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:53,899 INFO L93 Difference]: Finished difference Result 822 states and 1268 transitions. [2024-11-11 20:40:53,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:40:53,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 124 [2024-11-11 20:40:53,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:53,904 INFO L225 Difference]: With dead ends: 822 [2024-11-11 20:40:53,904 INFO L226 Difference]: Without dead ends: 462 [2024-11-11 20:40:53,906 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:40:53,908 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 134 mSDsluCounter, 539 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1138 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-11 20:40:53,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1138 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:40:53,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-11-11 20:40:53,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 454. [2024-11-11 20:40:53,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 358 states have (on average 1.5698324022346368) internal successors, (562), 360 states have internal predecessors, (562), 72 states have call successors, (72), 23 states have call predecessors, (72), 23 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2024-11-11 20:40:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 705 transitions. [2024-11-11 20:40:53,939 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 705 transitions. Word has length 124 [2024-11-11 20:40:53,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:53,939 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 705 transitions. [2024-11-11 20:40:53,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:40:53,939 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 705 transitions. [2024-11-11 20:40:53,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-11 20:40:53,942 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:53,943 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 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-11 20:40:53,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 20:40:54,143 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-11 20:40:54,144 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:54,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:54,145 INFO L85 PathProgramCache]: Analyzing trace with hash -2093375302, now seen corresponding path program 1 times [2024-11-11 20:40:54,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:54,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24962632] [2024-11-11 20:40:54,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:54,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:54,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:54,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:40:54,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:40:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:40:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:40:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:40:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:40:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:40:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:40:54,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:40:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:40:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:40:54,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:40:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:40:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-11 20:40:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-11 20:40:54,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,333 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2024-11-11 20:40:54,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:54,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24962632] [2024-11-11 20:40:54,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24962632] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:40:54,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1988742159] [2024-11-11 20:40:54,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:54,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:54,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:40:54,336 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-11 20:40:54,338 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-11 20:40:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:40:54,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:40:54,634 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-11 20:40:54,634 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:40:54,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1988742159] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:54,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:40:54,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-11 20:40:54,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634257348] [2024-11-11 20:40:54,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:54,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:40:54,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:54,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:40:54,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:40:54,637 INFO L87 Difference]: Start difference. First operand 454 states and 705 transitions. Second operand has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-11 20:40:54,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:54,691 INFO L93 Difference]: Finished difference Result 899 states and 1400 transitions. [2024-11-11 20:40:54,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:40:54,693 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 144 [2024-11-11 20:40:54,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:54,695 INFO L225 Difference]: With dead ends: 899 [2024-11-11 20:40:54,695 INFO L226 Difference]: Without dead ends: 456 [2024-11-11 20:40:54,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 173 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-11 20:40:54,698 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 2 mSDsluCounter, 1723 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2301 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-11 20:40:54,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2301 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:40:54,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-11 20:40:54,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 456. [2024-11-11 20:40:54,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 456 states, 359 states have (on average 1.5682451253481895) internal successors, (563), 362 states have internal predecessors, (563), 72 states have call successors, (72), 23 states have call predecessors, (72), 24 states have return successors, (73), 70 states have call predecessors, (73), 71 states have call successors, (73) [2024-11-11 20:40:54,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 708 transitions. [2024-11-11 20:40:54,719 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 708 transitions. Word has length 144 [2024-11-11 20:40:54,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:54,719 INFO L471 AbstractCegarLoop]: Abstraction has 456 states and 708 transitions. [2024-11-11 20:40:54,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-11 20:40:54,720 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 708 transitions. [2024-11-11 20:40:54,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-11 20:40:54,722 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:54,722 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:54,736 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-11 20:40:54,922 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-11 20:40:54,922 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:54,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:54,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1285036805, now seen corresponding path program 1 times [2024-11-11 20:40:54,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:54,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472335226] [2024-11-11 20:40:54,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:54,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:55,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:40:55,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:40:55,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:40:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:40:55,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:40:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:40:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:40:55,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:40:55,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:40:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:40:55,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:40:55,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 20:40:55,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-11 20:40:55,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-11 20:40:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,129 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2024-11-11 20:40:55,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:55,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472335226] [2024-11-11 20:40:55,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472335226] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:40:55,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1918585212] [2024-11-11 20:40:55,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:55,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:55,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:40:55,131 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-11 20:40:55,132 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-11 20:40:55,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,386 INFO L256 TraceCheckSpWp]: Trace formula consists of 1192 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 20:40:55,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:40:55,439 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2024-11-11 20:40:55,439 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:40:55,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1918585212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:55,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:40:55,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-11 20:40:55,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770683532] [2024-11-11 20:40:55,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:55,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:40:55,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:55,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:40:55,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:40:55,441 INFO L87 Difference]: Start difference. First operand 456 states and 708 transitions. Second operand has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-11 20:40:55,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:55,491 INFO L93 Difference]: Finished difference Result 901 states and 1405 transitions. [2024-11-11 20:40:55,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:40:55,491 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2024-11-11 20:40:55,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:55,493 INFO L225 Difference]: With dead ends: 901 [2024-11-11 20:40:55,493 INFO L226 Difference]: Without dead ends: 458 [2024-11-11 20:40:55,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 173 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-11 20:40:55,495 INFO L435 NwaCegarLoop]: 576 mSDtfsCounter, 2 mSDsluCounter, 1711 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2287 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-11 20:40:55,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2287 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:40:55,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-11-11 20:40:55,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2024-11-11 20:40:55,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 360 states have (on average 1.5666666666666667) internal successors, (564), 364 states have internal predecessors, (564), 72 states have call successors, (72), 23 states have call predecessors, (72), 25 states have return successors, (78), 70 states have call predecessors, (78), 71 states have call successors, (78) [2024-11-11 20:40:55,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 714 transitions. [2024-11-11 20:40:55,506 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 714 transitions. Word has length 145 [2024-11-11 20:40:55,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:55,507 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 714 transitions. [2024-11-11 20:40:55,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.8) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2024-11-11 20:40:55,507 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 714 transitions. [2024-11-11 20:40:55,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-11 20:40:55,508 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:55,509 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 20:40:55,527 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-11 20:40:55,709 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-11 20:40:55,709 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:55,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:55,710 INFO L85 PathProgramCache]: Analyzing trace with hash 808066477, now seen corresponding path program 1 times [2024-11-11 20:40:55,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:55,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814818443] [2024-11-11 20:40:55,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:55,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:55,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:55,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:55,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:55,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:40:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:40:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:40:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:40:55,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:40:55,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:40:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:40:55,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:40:55,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:40:55,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 20:40:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:55,886 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:40:55,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:55,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814818443] [2024-11-11 20:40:55,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814818443] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:55,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:55,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:40:55,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414810080] [2024-11-11 20:40:55,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:55,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:40:55,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:55,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:40:55,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:40:55,887 INFO L87 Difference]: Start difference. First operand 458 states and 714 transitions. Second operand has 9 states, 8 states have (on average 10.375) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-11 20:40:57,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:57,784 INFO L93 Difference]: Finished difference Result 1062 states and 1672 transitions. [2024-11-11 20:40:57,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:40:57,785 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 127 [2024-11-11 20:40:57,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:57,788 INFO L225 Difference]: With dead ends: 1062 [2024-11-11 20:40:57,788 INFO L226 Difference]: Without dead ends: 627 [2024-11-11 20:40:57,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:40:57,790 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 1292 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 2848 mSolverCounterSat, 407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 3255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 407 IncrementalHoareTripleChecker+Valid, 2848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:57,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 1339 Invalid, 3255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [407 Valid, 2848 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 20:40:57,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-11 20:40:57,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 458. [2024-11-11 20:40:57,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 360 states have (on average 1.5666666666666667) internal successors, (564), 364 states have internal predecessors, (564), 72 states have call successors, (72), 23 states have call predecessors, (72), 25 states have return successors, (77), 70 states have call predecessors, (77), 71 states have call successors, (77) [2024-11-11 20:40:57,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 713 transitions. [2024-11-11 20:40:57,817 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 713 transitions. Word has length 127 [2024-11-11 20:40:57,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:57,817 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 713 transitions. [2024-11-11 20:40:57,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.375) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-11 20:40:57,817 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 713 transitions. [2024-11-11 20:40:57,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-11 20:40:57,819 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:57,819 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:57,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:40:57,819 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:57,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:57,820 INFO L85 PathProgramCache]: Analyzing trace with hash -1696291680, now seen corresponding path program 2 times [2024-11-11 20:40:57,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:57,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [351672015] [2024-11-11 20:40:57,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:57,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:57,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:57,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:57,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:57,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:57,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:57,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:57,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:57,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:57,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:57,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:57,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:40:57,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:57,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:40:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:57,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:40:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:57,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:40:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:57,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:40:57,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:57,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:40:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:57,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:40:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:57,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:40:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:57,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:40:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:57,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 20:40:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:57,967 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:40:57,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:57,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [351672015] [2024-11-11 20:40:57,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [351672015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:57,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:57,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:40:57,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516758440] [2024-11-11 20:40:57,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:57,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:40:57,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:57,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:40:57,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:40:57,969 INFO L87 Difference]: Start difference. First operand 458 states and 713 transitions. Second operand has 9 states, 8 states have (on average 10.5) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-11 20:40:59,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:59,722 INFO L93 Difference]: Finished difference Result 1064 states and 1675 transitions. [2024-11-11 20:40:59,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:40:59,722 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.5) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 128 [2024-11-11 20:40:59,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:59,725 INFO L225 Difference]: With dead ends: 1064 [2024-11-11 20:40:59,725 INFO L226 Difference]: Without dead ends: 629 [2024-11-11 20:40:59,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:40:59,727 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 1292 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 2825 mSolverCounterSat, 425 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 3250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 425 IncrementalHoareTripleChecker+Valid, 2825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:59,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 1338 Invalid, 3250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [425 Valid, 2825 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 20:40:59,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-11 20:40:59,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 460. [2024-11-11 20:40:59,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 361 states have (on average 1.5650969529085872) internal successors, (565), 366 states have internal predecessors, (565), 72 states have call successors, (72), 23 states have call predecessors, (72), 26 states have return successors, (79), 70 states have call predecessors, (79), 71 states have call successors, (79) [2024-11-11 20:40:59,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 716 transitions. [2024-11-11 20:40:59,766 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 716 transitions. Word has length 128 [2024-11-11 20:40:59,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:59,766 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 716 transitions. [2024-11-11 20:40:59,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.5) internal successors, (84), 5 states have internal predecessors, (84), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-11 20:40:59,766 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 716 transitions. [2024-11-11 20:40:59,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-11 20:40:59,769 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:59,769 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 20:40:59,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:40:59,769 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:59,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:59,770 INFO L85 PathProgramCache]: Analyzing trace with hash 64211602, now seen corresponding path program 1 times [2024-11-11 20:40:59,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:59,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116476832] [2024-11-11 20:40:59,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:59,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:59,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:59,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:59,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:59,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:59,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:59,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:40:59,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:40:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:40:59,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:40:59,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:40:59,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:40:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:40:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:40:59,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-11 20:40:59,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:59,963 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:40:59,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:59,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116476832] [2024-11-11 20:40:59,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116476832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:59,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:59,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:40:59,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247144218] [2024-11-11 20:40:59,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:59,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:40:59,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:59,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:40:59,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:40:59,965 INFO L87 Difference]: Start difference. First operand 460 states and 716 transitions. Second operand has 12 states, 11 states have (on average 8.0) internal successors, (88), 8 states have internal predecessors, (88), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-11 20:41:02,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:41:02,192 INFO L93 Difference]: Finished difference Result 1062 states and 1670 transitions. [2024-11-11 20:41:02,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:41:02,192 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 8 states have internal predecessors, (88), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 129 [2024-11-11 20:41:02,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:41:02,196 INFO L225 Difference]: With dead ends: 1062 [2024-11-11 20:41:02,196 INFO L226 Difference]: Without dead ends: 629 [2024-11-11 20:41:02,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-11 20:41:02,198 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 1292 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 4757 mSolverCounterSat, 418 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 5175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 418 IncrementalHoareTripleChecker+Valid, 4757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:41:02,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 1856 Invalid, 5175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [418 Valid, 4757 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-11 20:41:02,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-11 20:41:02,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 460. [2024-11-11 20:41:02,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 361 states have (on average 1.5650969529085872) internal successors, (565), 366 states have internal predecessors, (565), 72 states have call successors, (72), 23 states have call predecessors, (72), 26 states have return successors, (78), 70 states have call predecessors, (78), 71 states have call successors, (78) [2024-11-11 20:41:02,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 715 transitions. [2024-11-11 20:41:02,225 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 715 transitions. Word has length 129 [2024-11-11 20:41:02,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:41:02,225 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 715 transitions. [2024-11-11 20:41:02,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.0) internal successors, (88), 8 states have internal predecessors, (88), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-11 20:41:02,225 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 715 transitions. [2024-11-11 20:41:02,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-11 20:41:02,226 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:41:02,226 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:41:02,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:41:02,227 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:41:02,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:41:02,227 INFO L85 PathProgramCache]: Analyzing trace with hash -41206052, now seen corresponding path program 2 times [2024-11-11 20:41:02,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:41:02,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745189403] [2024-11-11 20:41:02,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:41:02,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:41:02,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:02,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:41:02,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:02,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:41:02,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:02,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:41:02,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:02,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:41:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:02,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:41:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:02,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:41:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:02,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:41:02,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:02,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 20:41:02,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:02,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:41:02,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:02,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:41:02,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:02,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:41:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:02,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:41:02,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:02,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:41:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:02,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:41:02,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:02,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 20:41:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:02,414 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:41:02,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:41:02,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1745189403] [2024-11-11 20:41:02,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1745189403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:41:02,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:41:02,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:41:02,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324678263] [2024-11-11 20:41:02,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:41:02,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:41:02,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:41:02,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:41:02,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:41:02,416 INFO L87 Difference]: Start difference. First operand 460 states and 715 transitions. Second operand has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-11 20:41:04,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:41:04,602 INFO L93 Difference]: Finished difference Result 1064 states and 1676 transitions. [2024-11-11 20:41:04,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:41:04,602 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 130 [2024-11-11 20:41:04,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:41:04,605 INFO L225 Difference]: With dead ends: 1064 [2024-11-11 20:41:04,605 INFO L226 Difference]: Without dead ends: 631 [2024-11-11 20:41:04,607 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-11 20:41:04,607 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 1293 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 4716 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 5148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 4716 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:41:04,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1295 Valid, 1855 Invalid, 5148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 4716 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-11 20:41:04,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-11 20:41:04,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 462. [2024-11-11 20:41:04,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 362 states have (on average 1.5635359116022098) internal successors, (566), 368 states have internal predecessors, (566), 72 states have call successors, (72), 23 states have call predecessors, (72), 27 states have return successors, (83), 70 states have call predecessors, (83), 71 states have call successors, (83) [2024-11-11 20:41:04,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 721 transitions. [2024-11-11 20:41:04,631 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 721 transitions. Word has length 130 [2024-11-11 20:41:04,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:41:04,632 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 721 transitions. [2024-11-11 20:41:04,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.090909090909092) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (18), 6 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2024-11-11 20:41:04,632 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 721 transitions. [2024-11-11 20:41:04,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-11 20:41:04,633 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:41:04,633 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 20:41:04,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:41:04,634 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:41:04,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:41:04,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1081330841, now seen corresponding path program 1 times [2024-11-11 20:41:04,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:41:04,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971899344] [2024-11-11 20:41:04,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:41:04,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:41:04,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:04,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:41:04,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:04,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:41:04,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:04,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:41:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:04,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:41:04,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:04,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:41:04,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:04,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:41:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:04,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:41:04,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:04,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:41:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:04,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:41:04,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:04,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:41:04,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:04,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:41:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:04,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:41:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:04,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:41:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:04,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:41:04,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:04,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:41:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2024-11-11 20:41:04,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:41:04,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971899344] [2024-11-11 20:41:04,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971899344] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:41:04,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:41:04,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:41:04,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63760696] [2024-11-11 20:41:04,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:41:04,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:41:04,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:41:04,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:41:04,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:41:04,756 INFO L87 Difference]: Start difference. First operand 462 states and 721 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-11 20:41:06,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:41:06,171 INFO L93 Difference]: Finished difference Result 1066 states and 1679 transitions. [2024-11-11 20:41:06,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:41:06,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 131 [2024-11-11 20:41:06,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:41:06,174 INFO L225 Difference]: With dead ends: 1066 [2024-11-11 20:41:06,174 INFO L226 Difference]: Without dead ends: 631 [2024-11-11 20:41:06,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:41:06,176 INFO L435 NwaCegarLoop]: 205 mSDtfsCounter, 1292 mSDsluCounter, 1124 mSDsCounter, 0 mSdLazyCounter, 2841 mSolverCounterSat, 410 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1293 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 3251 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 410 IncrementalHoareTripleChecker+Valid, 2841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:41:06,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1293 Valid, 1329 Invalid, 3251 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [410 Valid, 2841 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:41:06,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 631 states. [2024-11-11 20:41:06,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 631 to 462. [2024-11-11 20:41:06,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 462 states, 362 states have (on average 1.5635359116022098) internal successors, (566), 368 states have internal predecessors, (566), 72 states have call successors, (72), 23 states have call predecessors, (72), 27 states have return successors, (83), 70 states have call predecessors, (83), 71 states have call successors, (83) [2024-11-11 20:41:06,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 462 states to 462 states and 721 transitions. [2024-11-11 20:41:06,199 INFO L78 Accepts]: Start accepts. Automaton has 462 states and 721 transitions. Word has length 131 [2024-11-11 20:41:06,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:41:06,199 INFO L471 AbstractCegarLoop]: Abstraction has 462 states and 721 transitions. [2024-11-11 20:41:06,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (18), 6 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2024-11-11 20:41:06,199 INFO L276 IsEmpty]: Start isEmpty. Operand 462 states and 721 transitions. [2024-11-11 20:41:06,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-11 20:41:06,200 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:41:06,201 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 20:41:06,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-11 20:41:06,201 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:41:06,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:41:06,201 INFO L85 PathProgramCache]: Analyzing trace with hash 1667607063, now seen corresponding path program 1 times [2024-11-11 20:41:06,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:41:06,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448687284] [2024-11-11 20:41:06,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:41:06,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:41:06,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:06,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:41:06,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:06,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:41:06,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:06,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:41:06,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:06,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:41:06,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:06,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:41:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:06,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:41:06,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:06,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:41:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:06,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:41:06,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:06,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:41:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:06,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:41:06,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:06,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:41:06,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:06,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:41:06,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:06,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:41:06,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:06,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:41:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:06,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:41:06,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:06,335 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:41:06,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:41:06,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448687284] [2024-11-11 20:41:06,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448687284] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:41:06,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1182414701] [2024-11-11 20:41:06,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:41:06,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:41:06,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:41:06,338 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-11 20:41:06,339 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-11 20:41:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:06,557 INFO L256 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:41:06,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:41:06,582 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:41:06,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:41:06,655 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:41:06,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1182414701] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:41:06,656 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:41:06,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 4, 4] total 11 [2024-11-11 20:41:06,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075718179] [2024-11-11 20:41:06,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:41:06,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:41:06,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:41:06,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:41:06,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:41:06,657 INFO L87 Difference]: Start difference. First operand 462 states and 721 transitions. Second operand has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 7 states have internal predecessors, (127), 2 states have call successors, (36), 6 states have call predecessors, (36), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-11 20:41:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:41:07,940 INFO L93 Difference]: Finished difference Result 1266 states and 2068 transitions. [2024-11-11 20:41:07,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:41:07,941 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 7 states have internal predecessors, (127), 2 states have call successors, (36), 6 states have call predecessors, (36), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 131 [2024-11-11 20:41:07,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:41:07,946 INFO L225 Difference]: With dead ends: 1266 [2024-11-11 20:41:07,946 INFO L226 Difference]: Without dead ends: 1073 [2024-11-11 20:41:07,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 304 GetRequests, 289 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=206, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:41:07,947 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 1983 mSDsluCounter, 1412 mSDsCounter, 0 mSdLazyCounter, 1800 mSolverCounterSat, 611 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2037 SdHoareTripleChecker+Valid, 1661 SdHoareTripleChecker+Invalid, 2411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 611 IncrementalHoareTripleChecker+Valid, 1800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:41:07,947 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2037 Valid, 1661 Invalid, 2411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [611 Valid, 1800 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:41:07,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1073 states. [2024-11-11 20:41:07,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1073 to 880. [2024-11-11 20:41:07,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 880 states, 701 states have (on average 1.6248216833095577) internal successors, (1139), 707 states have internal predecessors, (1139), 151 states have call successors, (151), 23 states have call predecessors, (151), 27 states have return successors, (172), 149 states have call predecessors, (172), 150 states have call successors, (172) [2024-11-11 20:41:07,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 880 states to 880 states and 1462 transitions. [2024-11-11 20:41:07,978 INFO L78 Accepts]: Start accepts. Automaton has 880 states and 1462 transitions. Word has length 131 [2024-11-11 20:41:07,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:41:07,978 INFO L471 AbstractCegarLoop]: Abstraction has 880 states and 1462 transitions. [2024-11-11 20:41:07,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 11.545454545454545) internal successors, (127), 7 states have internal predecessors, (127), 2 states have call successors, (36), 6 states have call predecessors, (36), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-11 20:41:07,978 INFO L276 IsEmpty]: Start isEmpty. Operand 880 states and 1462 transitions. [2024-11-11 20:41:07,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-11 20:41:07,981 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:41:07,981 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:41:07,996 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-11 20:41:08,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:41:08,182 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:41:08,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:41:08,183 INFO L85 PathProgramCache]: Analyzing trace with hash 1503956558, now seen corresponding path program 1 times [2024-11-11 20:41:08,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:41:08,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415874923] [2024-11-11 20:41:08,183 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:41:08,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:41:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:08,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:41:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:08,247 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:41:08,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:08,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:41:08,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:08,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:41:08,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:08,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:41:08,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:08,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:41:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:08,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:41:08,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:08,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:41:08,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:08,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:41:08,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:08,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:41:08,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:08,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:41:08,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:08,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:41:08,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:08,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:41:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:08,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 20:41:08,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:08,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 20:41:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:08,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-11 20:41:08,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:08,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2024-11-11 20:41:08,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:08,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2024-11-11 20:41:08,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:08,279 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 20:41:08,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:41:08,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415874923] [2024-11-11 20:41:08,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415874923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:41:08,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:41:08,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:41:08,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665728019] [2024-11-11 20:41:08,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:41:08,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:41:08,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:41:08,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:41:08,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:41:08,282 INFO L87 Difference]: Start difference. First operand 880 states and 1462 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-11 20:41:09,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:41:09,481 INFO L93 Difference]: Finished difference Result 2284 states and 3869 transitions. [2024-11-11 20:41:09,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:41:09,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2024-11-11 20:41:09,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:41:09,488 INFO L225 Difference]: With dead ends: 2284 [2024-11-11 20:41:09,488 INFO L226 Difference]: Without dead ends: 1472 [2024-11-11 20:41:09,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 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-11 20:41:09,491 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 1419 mSDsluCounter, 798 mSDsCounter, 0 mSdLazyCounter, 1638 mSolverCounterSat, 473 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1437 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 2111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 473 IncrementalHoareTripleChecker+Valid, 1638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:41:09,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1437 Valid, 1025 Invalid, 2111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [473 Valid, 1638 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:41:09,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1472 states. [2024-11-11 20:41:09,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1472 to 1295. [2024-11-11 20:41:09,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1295 states, 1037 states have (on average 1.6383799421407907) internal successors, (1699), 1043 states have internal predecessors, (1699), 230 states have call successors, (230), 23 states have call predecessors, (230), 27 states have return successors, (261), 228 states have call predecessors, (261), 229 states have call successors, (261) [2024-11-11 20:41:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1295 states to 1295 states and 2190 transitions. [2024-11-11 20:41:09,536 INFO L78 Accepts]: Start accepts. Automaton has 1295 states and 2190 transitions. Word has length 156 [2024-11-11 20:41:09,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:41:09,536 INFO L471 AbstractCegarLoop]: Abstraction has 1295 states and 2190 transitions. [2024-11-11 20:41:09,537 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-11 20:41:09,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1295 states and 2190 transitions. [2024-11-11 20:41:09,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-11 20:41:09,542 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:41:09,543 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:41:09,543 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:41:09,543 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:41:09,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:41:09,543 INFO L85 PathProgramCache]: Analyzing trace with hash -171115450, now seen corresponding path program 1 times [2024-11-11 20:41:09,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:41:09,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513661932] [2024-11-11 20:41:09,544 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:41:09,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:41:09,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:09,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:41:09,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:09,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:41:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:09,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:41:09,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:09,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:41:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:09,635 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:41:09,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:09,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:41:09,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:09,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:41:09,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:09,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:41:09,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:09,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:41:09,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:09,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:41:09,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:09,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:41:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:09,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:41:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:09,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:41:09,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:09,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 20:41:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:09,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-11 20:41:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:09,661 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:41:09,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:41:09,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513661932] [2024-11-11 20:41:09,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513661932] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:41:09,661 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:41:09,661 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:41:09,661 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900575467] [2024-11-11 20:41:09,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:41:09,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:41:09,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:41:09,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:41:09,662 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:41:09,662 INFO L87 Difference]: Start difference. First operand 1295 states and 2190 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:41:10,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:41:10,941 INFO L93 Difference]: Finished difference Result 3298 states and 5647 transitions. [2024-11-11 20:41:10,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:41:10,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 138 [2024-11-11 20:41:10,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:41:10,950 INFO L225 Difference]: With dead ends: 3298 [2024-11-11 20:41:10,950 INFO L226 Difference]: Without dead ends: 2124 [2024-11-11 20:41:10,953 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 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-11 20:41:10,953 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 1417 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1605 mSolverCounterSat, 479 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1435 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 2084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 479 IncrementalHoareTripleChecker+Valid, 1605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:41:10,954 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1435 Valid, 983 Invalid, 2084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [479 Valid, 1605 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:41:10,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2124 states. [2024-11-11 20:41:11,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2124 to 1947. [2024-11-11 20:41:11,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1947 states, 1570 states have (on average 1.6471337579617835) internal successors, (2586), 1576 states have internal predecessors, (2586), 349 states have call successors, (349), 23 states have call predecessors, (349), 27 states have return successors, (380), 347 states have call predecessors, (380), 348 states have call successors, (380) [2024-11-11 20:41:11,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1947 states to 1947 states and 3315 transitions. [2024-11-11 20:41:11,015 INFO L78 Accepts]: Start accepts. Automaton has 1947 states and 3315 transitions. Word has length 138 [2024-11-11 20:41:11,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:41:11,015 INFO L471 AbstractCegarLoop]: Abstraction has 1947 states and 3315 transitions. [2024-11-11 20:41:11,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:41:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 1947 states and 3315 transitions. [2024-11-11 20:41:11,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-11 20:41:11,022 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:41:11,022 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:41:11,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:41:11,022 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:41:11,022 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:41:11,023 INFO L85 PathProgramCache]: Analyzing trace with hash 2070131414, now seen corresponding path program 1 times [2024-11-11 20:41:11,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:41:11,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934985512] [2024-11-11 20:41:11,023 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:41:11,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:41:11,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:11,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:41:11,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:11,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:41:11,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:11,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:41:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:11,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:41:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:11,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:41:11,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:11,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:41:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:11,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:41:11,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:11,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:41:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:11,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:41:11,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:11,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:41:11,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:11,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:41:11,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:11,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:41:11,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:11,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:41:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:11,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 20:41:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:11,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-11 20:41:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:11,142 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:41:11,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:41:11,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934985512] [2024-11-11 20:41:11,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934985512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:41:11,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:41:11,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:41:11,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339693929] [2024-11-11 20:41:11,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:41:11,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:41:11,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:41:11,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:41:11,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:41:11,144 INFO L87 Difference]: Start difference. First operand 1947 states and 3315 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:41:12,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:41:12,253 INFO L93 Difference]: Finished difference Result 4828 states and 8349 transitions. [2024-11-11 20:41:12,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:41:12,254 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2024-11-11 20:41:12,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:41:12,266 INFO L225 Difference]: With dead ends: 4828 [2024-11-11 20:41:12,266 INFO L226 Difference]: Without dead ends: 3127 [2024-11-11 20:41:12,271 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 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-11 20:41:12,272 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 1415 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1603 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1433 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 2073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 1603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:41:12,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1433 Valid, 981 Invalid, 2073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 1603 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:41:12,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3127 states. [2024-11-11 20:41:12,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3127 to 2950. [2024-11-11 20:41:12,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2950 states, 2411 states have (on average 1.6540854417254252) internal successors, (3988), 2417 states have internal predecessors, (3988), 511 states have call successors, (511), 23 states have call predecessors, (511), 27 states have return successors, (558), 509 states have call predecessors, (558), 510 states have call successors, (558) [2024-11-11 20:41:12,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2950 states to 2950 states and 5057 transitions. [2024-11-11 20:41:12,377 INFO L78 Accepts]: Start accepts. Automaton has 2950 states and 5057 transitions. Word has length 139 [2024-11-11 20:41:12,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:41:12,377 INFO L471 AbstractCegarLoop]: Abstraction has 2950 states and 5057 transitions. [2024-11-11 20:41:12,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:41:12,377 INFO L276 IsEmpty]: Start isEmpty. Operand 2950 states and 5057 transitions. [2024-11-11 20:41:12,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-11 20:41:12,389 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:41:12,390 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:41:12,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:41:12,390 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:41:12,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:41:12,390 INFO L85 PathProgramCache]: Analyzing trace with hash -2140926361, now seen corresponding path program 1 times [2024-11-11 20:41:12,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:41:12,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242503476] [2024-11-11 20:41:12,391 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:41:12,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:41:12,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:12,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:41:12,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:12,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:41:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:12,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:41:12,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:12,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:41:12,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:12,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:41:12,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:12,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:41:12,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:12,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:41:12,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:12,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:41:12,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:12,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:41:12,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:12,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:41:12,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:12,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:41:12,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:12,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:41:12,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:12,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 20:41:12,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:12,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 20:41:12,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:12,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 20:41:12,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:12,480 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:41:12,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:41:12,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242503476] [2024-11-11 20:41:12,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242503476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:41:12,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:41:12,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:41:12,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420673662] [2024-11-11 20:41:12,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:41:12,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:41:12,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:41:12,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:41:12,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:41:12,482 INFO L87 Difference]: Start difference. First operand 2950 states and 5057 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:41:13,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:41:13,657 INFO L93 Difference]: Finished difference Result 7252 states and 12638 transitions. [2024-11-11 20:41:13,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:41:13,658 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 140 [2024-11-11 20:41:13,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:41:13,677 INFO L225 Difference]: With dead ends: 7252 [2024-11-11 20:41:13,677 INFO L226 Difference]: Without dead ends: 4752 [2024-11-11 20:41:13,683 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 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-11 20:41:13,684 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 1417 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1584 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1435 SdHoareTripleChecker+Valid, 980 SdHoareTripleChecker+Invalid, 2070 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 1584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:41:13,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1435 Valid, 980 Invalid, 2070 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 1584 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:41:13,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4752 states. [2024-11-11 20:41:13,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4752 to 4575. [2024-11-11 20:41:13,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4575 states, 3791 states have (on average 1.6589290424690055) internal successors, (6289), 3797 states have internal predecessors, (6289), 756 states have call successors, (756), 23 states have call predecessors, (756), 27 states have return successors, (829), 754 states have call predecessors, (829), 755 states have call successors, (829) [2024-11-11 20:41:13,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4575 states to 4575 states and 7874 transitions. [2024-11-11 20:41:13,816 INFO L78 Accepts]: Start accepts. Automaton has 4575 states and 7874 transitions. Word has length 140 [2024-11-11 20:41:13,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:41:13,816 INFO L471 AbstractCegarLoop]: Abstraction has 4575 states and 7874 transitions. [2024-11-11 20:41:13,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:41:13,816 INFO L276 IsEmpty]: Start isEmpty. Operand 4575 states and 7874 transitions. [2024-11-11 20:41:13,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2024-11-11 20:41:13,830 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:41:13,830 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:41:13,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 20:41:13,830 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:41:13,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:41:13,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1465925072, now seen corresponding path program 1 times [2024-11-11 20:41:13,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:41:13,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360173796] [2024-11-11 20:41:13,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:41:13,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:41:13,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:13,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:41:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:13,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:41:13,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:13,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:41:13,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:13,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:41:13,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:13,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:41:13,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:13,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:41:13,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:13,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:41:13,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:13,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:41:13,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:13,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:41:13,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:13,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:41:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:13,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:41:13,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:13,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:41:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:13,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 20:41:13,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:13,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 20:41:13,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:13,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 20:41:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:13,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-11 20:41:13,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:13,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-11 20:41:13,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:13,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-11 20:41:13,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:13,968 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 20:41:13,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:41:13,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360173796] [2024-11-11 20:41:13,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360173796] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:41:13,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:41:13,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:41:13,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654804964] [2024-11-11 20:41:13,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:41:13,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:41:13,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:41:13,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:41:13,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:41:13,971 INFO L87 Difference]: Start difference. First operand 4575 states and 7874 transitions. Second operand has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-11 20:41:15,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:41:15,230 INFO L93 Difference]: Finished difference Result 11298 states and 19798 transitions. [2024-11-11 20:41:15,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:41:15,230 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2024-11-11 20:41:15,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:41:15,265 INFO L225 Difference]: With dead ends: 11298 [2024-11-11 20:41:15,265 INFO L226 Difference]: Without dead ends: 7485 [2024-11-11 20:41:15,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 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-11 20:41:15,273 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 1414 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 1648 mSolverCounterSat, 489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1432 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 2137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 489 IncrementalHoareTripleChecker+Valid, 1648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:41:15,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1432 Valid, 1048 Invalid, 2137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [489 Valid, 1648 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:41:15,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7485 states. [2024-11-11 20:41:15,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7485 to 7308. [2024-11-11 20:41:15,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7308 states, 6031 states have (on average 1.6571049577184547) internal successors, (9994), 6037 states have internal predecessors, (9994), 1249 states have call successors, (1249), 23 states have call predecessors, (1249), 27 states have return successors, (1366), 1247 states have call predecessors, (1366), 1248 states have call successors, (1366) [2024-11-11 20:41:15,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7308 states to 7308 states and 12609 transitions. [2024-11-11 20:41:15,507 INFO L78 Accepts]: Start accepts. Automaton has 7308 states and 12609 transitions. Word has length 160 [2024-11-11 20:41:15,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:41:15,508 INFO L471 AbstractCegarLoop]: Abstraction has 7308 states and 12609 transitions. [2024-11-11 20:41:15,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.571428571428571) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-11 20:41:15,508 INFO L276 IsEmpty]: Start isEmpty. Operand 7308 states and 12609 transitions. [2024-11-11 20:41:15,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2024-11-11 20:41:15,527 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:41:15,527 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:41:15,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 20:41:15,527 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:41:15,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:41:15,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1388311159, now seen corresponding path program 1 times [2024-11-11 20:41:15,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:41:15,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556953807] [2024-11-11 20:41:15,529 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:41:15,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:41:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:15,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:41:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:15,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:41:15,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:15,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:41:15,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:15,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:41:15,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:15,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:41:15,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:15,592 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:41:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:15,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:41:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:15,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:41:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:15,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:41:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:15,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:41:15,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:15,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:41:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:15,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:41:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:15,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-11 20:41:15,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:15,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-11 20:41:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:15,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 20:41:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:15,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-11 20:41:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:15,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2024-11-11 20:41:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:15,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2024-11-11 20:41:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:15,624 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 20:41:15,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:41:15,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556953807] [2024-11-11 20:41:15,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556953807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:41:15,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:41:15,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:41:15,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161383155] [2024-11-11 20:41:15,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:41:15,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:41:15,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:41:15,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:41:15,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:41:15,625 INFO L87 Difference]: Start difference. First operand 7308 states and 12609 transitions. Second operand has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-11 20:41:16,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:41:16,956 INFO L93 Difference]: Finished difference Result 18633 states and 32682 transitions. [2024-11-11 20:41:16,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:41:16,957 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 161 [2024-11-11 20:41:16,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:41:16,990 INFO L225 Difference]: With dead ends: 18633 [2024-11-11 20:41:16,990 INFO L226 Difference]: Without dead ends: 12464 [2024-11-11 20:41:17,003 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 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-11 20:41:17,003 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 1410 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1594 mSolverCounterSat, 488 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 2082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 488 IncrementalHoareTripleChecker+Valid, 1594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:41:17,004 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1428 Valid, 982 Invalid, 2082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [488 Valid, 1594 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:41:17,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12464 states. [2024-11-11 20:41:17,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12464 to 12287. [2024-11-11 20:41:17,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12287 states, 10188 states have (on average 1.657243816254417) internal successors, (16884), 10194 states have internal predecessors, (16884), 2071 states have call successors, (2071), 23 states have call predecessors, (2071), 27 states have return successors, (2266), 2069 states have call predecessors, (2266), 2070 states have call successors, (2266) [2024-11-11 20:41:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12287 states to 12287 states and 21221 transitions. [2024-11-11 20:41:17,414 INFO L78 Accepts]: Start accepts. Automaton has 12287 states and 21221 transitions. Word has length 161 [2024-11-11 20:41:17,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:41:17,415 INFO L471 AbstractCegarLoop]: Abstraction has 12287 states and 21221 transitions. [2024-11-11 20:41:17,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.714285714285714) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-11 20:41:17,416 INFO L276 IsEmpty]: Start isEmpty. Operand 12287 states and 21221 transitions. [2024-11-11 20:41:17,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-11 20:41:17,446 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:41:17,446 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:41:17,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 20:41:17,447 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:41:17,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:41:17,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1270832512, now seen corresponding path program 1 times [2024-11-11 20:41:17,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:41:17,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962523111] [2024-11-11 20:41:17,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:41:17,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:41:17,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:17,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:41:17,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:17,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:41:17,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:17,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:41:17,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:17,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:41:17,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:17,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:41:17,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:17,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:41:17,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:17,532 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:41:17,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:17,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:41:17,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:17,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:41:17,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:17,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:41:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:17,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:41:17,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:17,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:41:17,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:17,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 20:41:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:17,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-11 20:41:17,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:17,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-11 20:41:17,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:41:17,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:41:17,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962523111] [2024-11-11 20:41:17,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962523111] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:41:17,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:41:17,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:41:17,553 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913199618] [2024-11-11 20:41:17,553 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:41:17,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:41:17,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:41:17,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:41:17,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:41:17,556 INFO L87 Difference]: Start difference. First operand 12287 states and 21221 transitions. Second operand has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:41:18,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:41:18,961 INFO L93 Difference]: Finished difference Result 29591 states and 51647 transitions. [2024-11-11 20:41:18,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:41:18,962 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 143 [2024-11-11 20:41:18,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:41:19,021 INFO L225 Difference]: With dead ends: 29591 [2024-11-11 20:41:19,022 INFO L226 Difference]: Without dead ends: 19417 [2024-11-11 20:41:19,049 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 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-11 20:41:19,049 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 1412 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 1577 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1431 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 2071 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 1577 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:41:19,050 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1431 Valid, 961 Invalid, 2071 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 1577 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:41:19,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19417 states. [2024-11-11 20:41:19,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19417 to 19240. [2024-11-11 20:41:19,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19240 states, 15938 states have (on average 1.632952691680261) internal successors, (26026), 15944 states have internal predecessors, (26026), 3274 states have call successors, (3274), 23 states have call predecessors, (3274), 27 states have return successors, (3613), 3272 states have call predecessors, (3613), 3273 states have call successors, (3613) [2024-11-11 20:41:19,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19240 states to 19240 states and 32913 transitions. [2024-11-11 20:41:19,658 INFO L78 Accepts]: Start accepts. Automaton has 19240 states and 32913 transitions. Word has length 143 [2024-11-11 20:41:19,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:41:19,658 INFO L471 AbstractCegarLoop]: Abstraction has 19240 states and 32913 transitions. [2024-11-11 20:41:19,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.857142857142858) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:41:19,658 INFO L276 IsEmpty]: Start isEmpty. Operand 19240 states and 32913 transitions. [2024-11-11 20:41:19,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-11 20:41:19,686 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:41:19,686 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:41:19,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 20:41:19,686 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:41:19,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:41:19,687 INFO L85 PathProgramCache]: Analyzing trace with hash 1049714028, now seen corresponding path program 1 times [2024-11-11 20:41:19,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:41:19,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069701041] [2024-11-11 20:41:19,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:41:19,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:41:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:19,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:41:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:19,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:41:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:19,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:41:19,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:19,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:41:19,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:19,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:41:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:19,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:41:19,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:19,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:41:19,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:19,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:41:19,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:19,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:41:19,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:19,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:41:19,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:19,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:41:19,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:19,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:41:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:19,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:41:19,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:19,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-11 20:41:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:19,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2024-11-11 20:41:19,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:19,778 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:41:19,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:41:19,778 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069701041] [2024-11-11 20:41:19,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069701041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:41:19,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:41:19,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:41:19,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952706092] [2024-11-11 20:41:19,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:41:19,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:41:19,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:41:19,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:41:19,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:41:19,779 INFO L87 Difference]: Start difference. First operand 19240 states and 32913 transitions. Second operand has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:41:21,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:41:21,742 INFO L93 Difference]: Finished difference Result 51023 states and 88767 transitions. [2024-11-11 20:41:21,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:41:21,742 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 144 [2024-11-11 20:41:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:41:21,828 INFO L225 Difference]: With dead ends: 51023 [2024-11-11 20:41:21,828 INFO L226 Difference]: Without dead ends: 34538 [2024-11-11 20:41:21,859 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 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-11 20:41:21,859 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 1408 mSDsluCounter, 771 mSDsCounter, 0 mSdLazyCounter, 1595 mSolverCounterSat, 495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1426 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 2090 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 495 IncrementalHoareTripleChecker+Valid, 1595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:41:21,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1426 Valid, 982 Invalid, 2090 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [495 Valid, 1595 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:41:21,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34538 states. [2024-11-11 20:41:22,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34538 to 34361. [2024-11-11 20:41:22,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34361 states, 28609 states have (on average 1.6298717186899228) internal successors, (46629), 28615 states have internal predecessors, (46629), 5724 states have call successors, (5724), 23 states have call predecessors, (5724), 27 states have return successors, (6337), 5722 states have call predecessors, (6337), 5723 states have call successors, (6337) [2024-11-11 20:41:22,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34361 states to 34361 states and 58690 transitions. [2024-11-11 20:41:22,834 INFO L78 Accepts]: Start accepts. Automaton has 34361 states and 58690 transitions. Word has length 144 [2024-11-11 20:41:22,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:41:22,834 INFO L471 AbstractCegarLoop]: Abstraction has 34361 states and 58690 transitions. [2024-11-11 20:41:22,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.0) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:41:22,834 INFO L276 IsEmpty]: Start isEmpty. Operand 34361 states and 58690 transitions. [2024-11-11 20:41:22,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-11 20:41:22,864 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:41:22,864 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:41:22,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 20:41:22,864 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:41:22,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:41:22,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1245132262, now seen corresponding path program 1 times [2024-11-11 20:41:22,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:41:22,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430806451] [2024-11-11 20:41:22,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:41:22,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:41:22,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:41:22,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:41:22,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:41:22,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:41:22,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:41:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:41:22,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:41:22,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:41:22,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:41:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:41:22,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:41:22,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:41:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 20:41:22,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-11 20:41:22,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-11 20:41:22,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:22,947 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:41:22,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:41:22,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430806451] [2024-11-11 20:41:22,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430806451] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:41:22,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:41:22,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:41:22,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127480537] [2024-11-11 20:41:22,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:41:22,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:41:22,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:41:22,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:41:22,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:41:22,948 INFO L87 Difference]: Start difference. First operand 34361 states and 58690 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:41:25,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:41:25,462 INFO L93 Difference]: Finished difference Result 93895 states and 162561 transitions. [2024-11-11 20:41:25,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:41:25,463 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 145 [2024-11-11 20:41:25,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:41:25,699 INFO L225 Difference]: With dead ends: 93895 [2024-11-11 20:41:25,699 INFO L226 Difference]: Without dead ends: 63205 [2024-11-11 20:41:25,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 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-11 20:41:25,803 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 1409 mSDsluCounter, 783 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 506 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1428 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 2087 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 506 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:41:25,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1428 Valid, 998 Invalid, 2087 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [506 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:41:25,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63205 states. [2024-11-11 20:41:27,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63205 to 63028. [2024-11-11 20:41:27,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63028 states, 52763 states have (on average 1.6257604760912003) internal successors, (85780), 52769 states have internal predecessors, (85780), 10237 states have call successors, (10237), 23 states have call predecessors, (10237), 27 states have return successors, (11382), 10235 states have call predecessors, (11382), 10236 states have call successors, (11382) [2024-11-11 20:41:27,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63028 states to 63028 states and 107399 transitions. [2024-11-11 20:41:27,655 INFO L78 Accepts]: Start accepts. Automaton has 63028 states and 107399 transitions. Word has length 145 [2024-11-11 20:41:27,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:41:27,655 INFO L471 AbstractCegarLoop]: Abstraction has 63028 states and 107399 transitions. [2024-11-11 20:41:27,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (18), 6 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-11 20:41:27,656 INFO L276 IsEmpty]: Start isEmpty. Operand 63028 states and 107399 transitions. [2024-11-11 20:41:27,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2024-11-11 20:41:27,696 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:41:27,696 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:41:27,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 20:41:27,697 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:41:27,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:41:27,697 INFO L85 PathProgramCache]: Analyzing trace with hash -431446666, now seen corresponding path program 1 times [2024-11-11 20:41:27,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:41:27,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231289057] [2024-11-11 20:41:27,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:41:27,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:41:27,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:27,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:41:27,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:27,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:41:27,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:27,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:41:27,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:27,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:41:27,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:27,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:41:27,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:27,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:41:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:27,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:41:27,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:27,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:41:27,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:27,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:41:27,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:27,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:41:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:27,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:41:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:27,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:41:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:27,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 20:41:27,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:27,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-11 20:41:27,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:27,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2024-11-11 20:41:27,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:27,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-11 20:41:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:27,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-11 20:41:27,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:27,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-11 20:41:27,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:27,780 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 20:41:27,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:41:27,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231289057] [2024-11-11 20:41:27,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231289057] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:41:27,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:41:27,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:41:27,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388730032] [2024-11-11 20:41:27,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:41:27,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:41:27,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:41:27,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:41:27,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:41:27,783 INFO L87 Difference]: Start difference. First operand 63028 states and 107399 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-11 20:41:31,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:41:31,067 INFO L93 Difference]: Finished difference Result 118271 states and 205195 transitions. [2024-11-11 20:41:31,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:41:31,068 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 165 [2024-11-11 20:41:31,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:41:31,452 INFO L225 Difference]: With dead ends: 118271 [2024-11-11 20:41:31,452 INFO L226 Difference]: Without dead ends: 118078 [2024-11-11 20:41:31,494 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 38 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-11 20:41:31,495 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 1399 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 1611 mSolverCounterSat, 465 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 1020 SdHoareTripleChecker+Invalid, 2076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 465 IncrementalHoareTripleChecker+Valid, 1611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:41:31,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1416 Valid, 1020 Invalid, 2076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [465 Valid, 1611 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 20:41:31,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118078 states. [2024-11-11 20:41:35,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118078 to 117901. [2024-11-11 20:41:35,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117901 states, 99268 states have (on average 1.6205725913688198) internal successors, (160871), 99274 states have internal predecessors, (160871), 18605 states have call successors, (18605), 23 states have call predecessors, (18605), 27 states have return successors, (20796), 18603 states have call predecessors, (20796), 18604 states have call successors, (20796) [2024-11-11 20:41:35,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117901 states to 117901 states and 200272 transitions. [2024-11-11 20:41:35,960 INFO L78 Accepts]: Start accepts. Automaton has 117901 states and 200272 transitions. Word has length 165 [2024-11-11 20:41:35,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:41:35,961 INFO L471 AbstractCegarLoop]: Abstraction has 117901 states and 200272 transitions. [2024-11-11 20:41:35,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 3 states have internal predecessors, (107), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-11 20:41:35,961 INFO L276 IsEmpty]: Start isEmpty. Operand 117901 states and 200272 transitions. [2024-11-11 20:41:36,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2024-11-11 20:41:36,050 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:41:36,050 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:41:36,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 20:41:36,051 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:41:36,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:41:36,053 INFO L85 PathProgramCache]: Analyzing trace with hash 20407945, now seen corresponding path program 1 times [2024-11-11 20:41:36,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:41:36,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284734717] [2024-11-11 20:41:36,054 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:41:36,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:41:36,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:36,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:41:36,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:36,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:41:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:36,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:41:36,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:36,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:41:36,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:36,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:41:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:36,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:41:36,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:36,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:41:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:36,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:41:36,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:36,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:41:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:36,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:41:36,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:36,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:41:36,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:36,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:41:36,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:36,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 20:41:36,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:36,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 20:41:36,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:36,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-11 20:41:36,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:36,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-11 20:41:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:36,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2024-11-11 20:41:36,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:36,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2024-11-11 20:41:36,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:36,248 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2024-11-11 20:41:36,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:41:36,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284734717] [2024-11-11 20:41:36,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284734717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:41:36,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:41:36,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-11 20:41:36,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790279222] [2024-11-11 20:41:36,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:41:36,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:41:36,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:41:36,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:41:36,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:41:36,250 INFO L87 Difference]: Start difference. First operand 117901 states and 200272 transitions. Second operand has 10 states, 10 states have (on average 10.8) internal successors, (108), 5 states have internal predecessors, (108), 2 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-11 20:41:42,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:41:42,148 INFO L93 Difference]: Finished difference Result 227063 states and 393526 transitions. [2024-11-11 20:41:42,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-11 20:41:42,150 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 5 states have internal predecessors, (108), 2 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 166 [2024-11-11 20:41:42,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:41:43,117 INFO L225 Difference]: With dead ends: 227063 [2024-11-11 20:41:43,117 INFO L226 Difference]: Without dead ends: 226878 [2024-11-11 20:41:43,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=172, Invalid=428, Unknown=0, NotChecked=0, Total=600 [2024-11-11 20:41:43,183 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 2921 mSDsluCounter, 1469 mSDsCounter, 0 mSdLazyCounter, 3576 mSolverCounterSat, 902 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2938 SdHoareTripleChecker+Valid, 1714 SdHoareTripleChecker+Invalid, 4478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 902 IncrementalHoareTripleChecker+Valid, 3576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:41:43,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2938 Valid, 1714 Invalid, 4478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [902 Valid, 3576 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 20:41:43,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226878 states. [2024-11-11 20:41:50,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226878 to 226534. [2024-11-11 20:41:50,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226534 states, 190771 states have (on average 1.6239051008801129) internal successors, (309794), 190723 states have internal predecessors, (309794), 35712 states have call successors, (35712), 45 states have call predecessors, (35712), 50 states have return successors, (38995), 35765 states have call predecessors, (38995), 35710 states have call successors, (38995) [2024-11-11 20:41:51,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226534 states to 226534 states and 384501 transitions. [2024-11-11 20:41:51,360 INFO L78 Accepts]: Start accepts. Automaton has 226534 states and 384501 transitions. Word has length 166 [2024-11-11 20:41:51,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:41:51,361 INFO L471 AbstractCegarLoop]: Abstraction has 226534 states and 384501 transitions. [2024-11-11 20:41:51,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.8) internal successors, (108), 5 states have internal predecessors, (108), 2 states have call successors, (21), 7 states have call predecessors, (21), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-11 20:41:51,361 INFO L276 IsEmpty]: Start isEmpty. Operand 226534 states and 384501 transitions. [2024-11-11 20:41:51,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-11 20:41:51,414 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:41:51,414 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:41:51,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-11 20:41:51,415 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__KeysErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:41:51,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:41:51,415 INFO L85 PathProgramCache]: Analyzing trace with hash 320007001, now seen corresponding path program 1 times [2024-11-11 20:41:51,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:41:51,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367538237] [2024-11-11 20:41:51,416 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:41:51,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:41:51,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:51,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:41:51,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:51,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:41:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:51,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:41:51,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:51,523 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:41:51,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:51,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:41:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:51,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:41:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:51,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:41:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:51,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:41:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:51,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:41:51,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:51,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:41:51,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:51,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:41:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:51,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 20:41:51,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:51,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 20:41:51,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:51,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 20:41:51,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:51,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-11 20:41:51,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:41:51,565 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:41:51,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:41:51,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367538237] [2024-11-11 20:41:51,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367538237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:41:51,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:41:51,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 20:41:51,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551112730] [2024-11-11 20:41:51,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:41:51,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:41:51,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:41:51,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:41:51,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:41:51,567 INFO L87 Difference]: Start difference. First operand 226534 states and 384501 transitions. Second operand has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 6 states have internal predecessors, (101), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15)