./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product32.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product32.cil.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 50599b90019c0f8b15701a8959406dc5e052f09e6cd358b81cb6701fde5581e5 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 02:56:20,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 02:56:20,500 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 02:56:20,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 02:56:20,506 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 02:56:20,531 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 02:56:20,531 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 02:56:20,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 02:56:20,532 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 02:56:20,532 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 02:56:20,533 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 02:56:20,533 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 02:56:20,534 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 02:56:20,536 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 02:56:20,536 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 02:56:20,536 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 02:56:20,537 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 02:56:20,537 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 02:56:20,537 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 02:56:20,537 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 02:56:20,537 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 02:56:20,538 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 02:56:20,538 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 02:56:20,538 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 02:56:20,538 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 02:56:20,539 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 02:56:20,539 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 02:56:20,539 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 02:56:20,539 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 02:56:20,539 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 02:56:20,540 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 02:56:20,540 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 02:56:20,540 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:56:20,540 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 02:56:20,540 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 02:56:20,541 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 02:56:20,541 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 02:56:20,541 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 02:56:20,542 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 02:56:20,542 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 02:56:20,542 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 02:56:20,543 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 02:56:20,543 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-clean/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-clean/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 -> 50599b90019c0f8b15701a8959406dc5e052f09e6cd358b81cb6701fde5581e5 [2024-10-11 02:56:20,741 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 02:56:20,761 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 02:56:20,763 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 02:56:20,764 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 02:56:20,764 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 02:56:20,765 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product32.cil.c [2024-10-11 02:56:21,994 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 02:56:22,241 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 02:56:22,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec9_product32.cil.c [2024-10-11 02:56:22,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/80515911c/7ded2d7523914a9e96b7af282d658e91/FLAGc59ac8063 [2024-10-11 02:56:22,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/80515911c/7ded2d7523914a9e96b7af282d658e91 [2024-10-11 02:56:22,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 02:56:22,287 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 02:56:22,288 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 02:56:22,288 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 02:56:22,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 02:56:22,293 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:56:22" (1/1) ... [2024-10-11 02:56:22,295 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50895129 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:22, skipping insertion in model container [2024-10-11 02:56:22,295 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:56:22" (1/1) ... [2024-10-11 02:56:22,355 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 02:56:22,782 WARN L248 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_spec9_product32.cil.c[51167,51180] [2024-10-11 02:56:22,841 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:56:22,852 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 02:56:22,861 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2024-10-11 02:56:22,862 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [208] [2024-10-11 02:56:22,862 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [437] [2024-10-11 02:56:22,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [859] [2024-10-11 02:56:22,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1256] [2024-10-11 02:56:22,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1273] [2024-10-11 02:56:22,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2345] [2024-10-11 02:56:22,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2383] [2024-10-11 02:56:22,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptForward_spec.i","") [2392] [2024-10-11 02:56:22,863 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2434] [2024-10-11 02:56:22,864 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2800] [2024-10-11 02:56:22,946 WARN L248 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_spec9_product32.cil.c[51167,51180] [2024-10-11 02:56:22,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 02:56:22,995 INFO L204 MainTranslator]: Completed translation [2024-10-11 02:56:22,996 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:22 WrapperNode [2024-10-11 02:56:22,996 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 02:56:22,997 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 02:56:22,997 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 02:56:22,997 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 02:56:23,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:22" (1/1) ... [2024-10-11 02:56:23,032 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:22" (1/1) ... [2024-10-11 02:56:23,072 INFO L138 Inliner]: procedures = 135, calls = 222, calls flagged for inlining = 62, calls inlined = 54, statements flattened = 999 [2024-10-11 02:56:23,072 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 02:56:23,073 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 02:56:23,073 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 02:56:23,073 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 02:56:23,081 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:22" (1/1) ... [2024-10-11 02:56:23,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:22" (1/1) ... [2024-10-11 02:56:23,091 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:22" (1/1) ... [2024-10-11 02:56:23,123 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-10-11 02:56:23,124 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:22" (1/1) ... [2024-10-11 02:56:23,124 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:22" (1/1) ... [2024-10-11 02:56:23,140 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:22" (1/1) ... [2024-10-11 02:56:23,146 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:22" (1/1) ... [2024-10-11 02:56:23,150 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:22" (1/1) ... [2024-10-11 02:56:23,153 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:22" (1/1) ... [2024-10-11 02:56:23,162 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 02:56:23,163 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 02:56:23,163 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 02:56:23,163 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 02:56:23,164 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:22" (1/1) ... [2024-10-11 02:56:23,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 02:56:23,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:56:23,202 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 02:56:23,204 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 02:56:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-10-11 02:56:23,238 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-10-11 02:56:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2024-10-11 02:56:23,238 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2024-10-11 02:56:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-10-11 02:56:23,238 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-10-11 02:56:23,238 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2024-10-11 02:56:23,239 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2024-10-11 02:56:23,239 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-10-11 02:56:23,240 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-10-11 02:56:23,240 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-10-11 02:56:23,240 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-10-11 02:56:23,240 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2024-10-11 02:56:23,240 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2024-10-11 02:56:23,241 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-10-11 02:56:23,241 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-10-11 02:56:23,241 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-10-11 02:56:23,241 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-10-11 02:56:23,241 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-10-11 02:56:23,241 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-10-11 02:56:23,241 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-10-11 02:56:23,241 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-10-11 02:56:23,241 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-10-11 02:56:23,241 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-10-11 02:56:23,241 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-10-11 02:56:23,241 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-10-11 02:56:23,242 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-10-11 02:56:23,242 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-10-11 02:56:23,242 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-10-11 02:56:23,242 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-10-11 02:56:23,242 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 02:56:23,242 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-10-11 02:56:23,242 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-10-11 02:56:23,242 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-10-11 02:56:23,242 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-10-11 02:56:23,242 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2024-10-11 02:56:23,242 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2024-10-11 02:56:23,242 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-10-11 02:56:23,242 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-10-11 02:56:23,242 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-10-11 02:56:23,242 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-10-11 02:56:23,242 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-10-11 02:56:23,243 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-10-11 02:56:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-10-11 02:56:23,243 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-10-11 02:56:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-10-11 02:56:23,243 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-10-11 02:56:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-10-11 02:56:23,243 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-10-11 02:56:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-10-11 02:56:23,243 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-10-11 02:56:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-10-11 02:56:23,243 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-10-11 02:56:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 02:56:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 02:56:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 02:56:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 02:56:23,243 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-10-11 02:56:23,244 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-10-11 02:56:23,244 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2024-10-11 02:56:23,244 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2024-10-11 02:56:23,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 02:56:23,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 02:56:23,393 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 02:56:23,395 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 02:56:24,128 INFO L? ?]: Removed 539 outVars from TransFormulas that were not future-live. [2024-10-11 02:56:24,128 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 02:56:24,180 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 02:56:24,181 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 02:56:24,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:56:24 BoogieIcfgContainer [2024-10-11 02:56:24,181 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 02:56:24,183 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 02:56:24,183 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 02:56:24,185 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 02:56:24,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:56:22" (1/3) ... [2024-10-11 02:56:24,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311b1dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:56:24, skipping insertion in model container [2024-10-11 02:56:24,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:56:22" (2/3) ... [2024-10-11 02:56:24,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@311b1dc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:56:24, skipping insertion in model container [2024-10-11 02:56:24,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:56:24" (3/3) ... [2024-10-11 02:56:24,187 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec9_product32.cil.c [2024-10-11 02:56:24,200 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 02:56:24,200 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 02:56:24,262 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 02:56:24,267 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;@75708587, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 02:56:24,268 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 02:56:24,274 INFO L276 IsEmpty]: Start isEmpty. Operand has 397 states, 302 states have (on average 1.6026490066225165) internal successors, (484), 307 states have internal predecessors, (484), 65 states have call successors, (65), 28 states have call predecessors, (65), 28 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2024-10-11 02:56:24,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-11 02:56:24,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:24,296 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:24,297 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:24,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:24,302 INFO L85 PathProgramCache]: Analyzing trace with hash 649389122, now seen corresponding path program 1 times [2024-10-11 02:56:24,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:24,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616953075] [2024-10-11 02:56:24,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:24,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:24,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:24,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:24,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:24,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:56:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:56:24,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:56:24,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-11 02:56:24,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 02:56:24,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:24,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:56:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:25,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:56:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:25,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:56:25,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:25,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:56:25,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:25,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:56:25,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:25,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:56:25,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:25,030 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:56:25,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:25,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616953075] [2024-10-11 02:56:25,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616953075] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:56:25,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1587874859] [2024-10-11 02:56:25,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:25,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:56:25,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:56:25,034 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:56:25,035 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 02:56:25,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:25,322 INFO L255 TraceCheckSpWp]: Trace formula consists of 1094 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 02:56:25,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:56:25,351 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:56:25,353 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:56:25,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1587874859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:25,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:56:25,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-10-11 02:56:25,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33437072] [2024-10-11 02:56:25,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:25,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 02:56:25,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:25,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 02:56:25,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:56:25,386 INFO L87 Difference]: Start difference. First operand has 397 states, 302 states have (on average 1.6026490066225165) internal successors, (484), 307 states have internal predecessors, (484), 65 states have call successors, (65), 28 states have call predecessors, (65), 28 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) Second operand has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:25,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:25,475 INFO L93 Difference]: Finished difference Result 610 states and 927 transitions. [2024-10-11 02:56:25,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 02:56:25,478 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 104 [2024-10-11 02:56:25,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:25,493 INFO L225 Difference]: With dead ends: 610 [2024-10-11 02:56:25,493 INFO L226 Difference]: Without dead ends: 394 [2024-10-11 02:56:25,501 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 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-10-11 02:56:25,504 INFO L432 NwaCegarLoop]: 594 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:25,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 594 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:56:25,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-11 02:56:25,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 394. [2024-10-11 02:56:25,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 300 states have (on average 1.59) internal successors, (477), 304 states have internal predecessors, (477), 65 states have call successors, (65), 28 states have call predecessors, (65), 28 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 02:56:25,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 606 transitions. [2024-10-11 02:56:25,575 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 606 transitions. Word has length 104 [2024-10-11 02:56:25,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:25,577 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 606 transitions. [2024-10-11 02:56:25,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.0) internal successors, (58), 2 states have internal predecessors, (58), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:25,577 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 606 transitions. [2024-10-11 02:56:25,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-11 02:56:25,583 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:25,583 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:25,599 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 02:56:25,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-10-11 02:56:25,784 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:25,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:25,785 INFO L85 PathProgramCache]: Analyzing trace with hash -641533922, now seen corresponding path program 1 times [2024-10-11 02:56:25,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:25,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666892716] [2024-10-11 02:56:25,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:25,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:25,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:25,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:25,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:25,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:25,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:25,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:25,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:56:26,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:56:26,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:56:26,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-11 02:56:26,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-11 02:56:26,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:56:26,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:56:26,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:56:26,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:56:26,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:56:26,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:56:26,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,044 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-10-11 02:56:26,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:26,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666892716] [2024-10-11 02:56:26,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666892716] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:56:26,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [599909456] [2024-10-11 02:56:26,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:26,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:56:26,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:56:26,047 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:56:26,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 02:56:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,292 INFO L255 TraceCheckSpWp]: Trace formula consists of 1095 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-11 02:56:26,296 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:56:26,324 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:56:26,326 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:56:26,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [599909456] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:26,326 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:56:26,326 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:56:26,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46311628] [2024-10-11 02:56:26,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:26,327 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:56:26,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:26,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:56:26,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:56:26,329 INFO L87 Difference]: Start difference. First operand 394 states and 606 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:26,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:26,412 INFO L93 Difference]: Finished difference Result 606 states and 911 transitions. [2024-10-11 02:56:26,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:56:26,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2024-10-11 02:56:26,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:26,415 INFO L225 Difference]: With dead ends: 606 [2024-10-11 02:56:26,416 INFO L226 Difference]: Without dead ends: 396 [2024-10-11 02:56:26,416 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 128 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-10-11 02:56:26,417 INFO L432 NwaCegarLoop]: 591 mSDtfsCounter, 0 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1181 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:26,417 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1181 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:56:26,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-11 02:56:26,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-10-11 02:56:26,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 302 states have (on average 1.586092715231788) internal successors, (479), 306 states have internal predecessors, (479), 65 states have call successors, (65), 28 states have call predecessors, (65), 28 states have return successors, (64), 63 states have call predecessors, (64), 64 states have call successors, (64) [2024-10-11 02:56:26,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 608 transitions. [2024-10-11 02:56:26,440 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 608 transitions. Word has length 105 [2024-10-11 02:56:26,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:26,440 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 608 transitions. [2024-10-11 02:56:26,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:26,440 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 608 transitions. [2024-10-11 02:56:26,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-11 02:56:26,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:26,443 INFO L215 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] [2024-10-11 02:56:26,459 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 02:56:26,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:56:26,645 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:26,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:26,645 INFO L85 PathProgramCache]: Analyzing trace with hash -560857538, now seen corresponding path program 1 times [2024-10-11 02:56:26,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:26,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337333627] [2024-10-11 02:56:26,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:26,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:26,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:26,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:26,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:26,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:56:26,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:56:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:56:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-11 02:56:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:56:26,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:56:26,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:56:26,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:56:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:56:26,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:56:26,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:56:26,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:26,852 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:56:26,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:26,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337333627] [2024-10-11 02:56:26,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337333627] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:56:26,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864934859] [2024-10-11 02:56:26,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:26,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:56:26,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:56:26,855 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:56:26,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 02:56:27,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:56:27,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:56:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 02:56:27,107 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:56:27,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864934859] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:27,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:56:27,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-10-11 02:56:27,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807544429] [2024-10-11 02:56:27,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:27,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 02:56:27,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:27,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 02:56:27,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 02:56:27,109 INFO L87 Difference]: Start difference. First operand 396 states and 608 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:27,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:27,156 INFO L93 Difference]: Finished difference Result 840 states and 1308 transitions. [2024-10-11 02:56:27,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 02:56:27,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2024-10-11 02:56:27,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:27,159 INFO L225 Difference]: With dead ends: 840 [2024-10-11 02:56:27,160 INFO L226 Difference]: Without dead ends: 466 [2024-10-11 02:56:27,161 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 135 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-10-11 02:56:27,161 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 129 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1144 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:27,162 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1144 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 02:56:27,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2024-10-11 02:56:27,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 461. [2024-10-11 02:56:27,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 353 states have (on average 1.6033994334277621) internal successors, (566), 357 states have internal predecessors, (566), 79 states have call successors, (79), 28 states have call predecessors, (79), 28 states have return successors, (78), 77 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 02:56:27,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 723 transitions. [2024-10-11 02:56:27,186 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 723 transitions. Word has length 112 [2024-10-11 02:56:27,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:27,187 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 723 transitions. [2024-10-11 02:56:27,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:27,187 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 723 transitions. [2024-10-11 02:56:27,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 02:56:27,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:27,189 INFO L215 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] [2024-10-11 02:56:27,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 02:56:27,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:56:27,390 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:27,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:27,391 INFO L85 PathProgramCache]: Analyzing trace with hash -373822168, now seen corresponding path program 1 times [2024-10-11 02:56:27,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:27,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143424265] [2024-10-11 02:56:27,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:27,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:27,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,519 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:27,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:27,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 02:56:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-11 02:56:27,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-11 02:56:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-11 02:56:27,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:56:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:56:27,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:56:27,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:56:27,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:56:27,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:56:27,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:56:27,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,580 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:56:27,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:27,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143424265] [2024-10-11 02:56:27,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143424265] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:56:27,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122190669] [2024-10-11 02:56:27,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:27,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:56:27,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:56:27,582 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:56:27,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 02:56:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:27,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-11 02:56:27,809 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:56:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 02:56:27,860 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:56:27,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122190669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:27,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:56:27,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-10-11 02:56:27,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373969914] [2024-10-11 02:56:27,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:27,861 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:56:27,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:27,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:56:27,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:56:27,862 INFO L87 Difference]: Start difference. First operand 461 states and 723 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:56:27,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:27,958 INFO L93 Difference]: Finished difference Result 917 states and 1440 transitions. [2024-10-11 02:56:27,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:56:27,961 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 113 [2024-10-11 02:56:27,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:27,963 INFO L225 Difference]: With dead ends: 917 [2024-10-11 02:56:27,963 INFO L226 Difference]: Without dead ends: 463 [2024-10-11 02:56:27,965 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 134 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-10-11 02:56:27,967 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 2 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2321 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:27,968 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2321 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:56:27,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-11 02:56:27,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 463. [2024-10-11 02:56:27,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 463 states, 354 states have (on average 1.6016949152542372) internal successors, (567), 359 states have internal predecessors, (567), 79 states have call successors, (79), 28 states have call predecessors, (79), 29 states have return successors, (80), 77 states have call predecessors, (80), 78 states have call successors, (80) [2024-10-11 02:56:27,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 726 transitions. [2024-10-11 02:56:27,989 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 726 transitions. Word has length 113 [2024-10-11 02:56:27,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:27,989 INFO L471 AbstractCegarLoop]: Abstraction has 463 states and 726 transitions. [2024-10-11 02:56:27,989 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:56:27,990 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 726 transitions. [2024-10-11 02:56:27,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 02:56:27,992 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:27,992 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 02:56:28,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 02:56:28,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:56:28,193 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:28,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:28,194 INFO L85 PathProgramCache]: Analyzing trace with hash -2110242164, now seen corresponding path program 1 times [2024-10-11 02:56:28,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:28,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810714556] [2024-10-11 02:56:28,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:28,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:28,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-11 02:56:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-10-11 02:56:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 02:56:28,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:56:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:56:28,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:56:28,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:56:28,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:56:28,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:56:28,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:56:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,424 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:56:28,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:28,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810714556] [2024-10-11 02:56:28,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810714556] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:56:28,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1078311671] [2024-10-11 02:56:28,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:28,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:56:28,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:56:28,427 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:56:28,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 02:56:28,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:28,669 INFO L255 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 02:56:28,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:56:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 02:56:28,726 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 02:56:28,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1078311671] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:28,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 02:56:28,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-10-11 02:56:28,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899781314] [2024-10-11 02:56:28,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:28,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 02:56:28,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:28,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 02:56:28,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:56:28,729 INFO L87 Difference]: Start difference. First operand 463 states and 726 transitions. Second operand has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:56:28,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:28,826 INFO L93 Difference]: Finished difference Result 919 states and 1445 transitions. [2024-10-11 02:56:28,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 02:56:28,827 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 114 [2024-10-11 02:56:28,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:28,830 INFO L225 Difference]: With dead ends: 919 [2024-10-11 02:56:28,830 INFO L226 Difference]: Without dead ends: 465 [2024-10-11 02:56:28,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 134 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-10-11 02:56:28,832 INFO L432 NwaCegarLoop]: 581 mSDtfsCounter, 2 mSDsluCounter, 1726 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2307 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:28,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2307 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 02:56:28,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-10-11 02:56:28,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 465. [2024-10-11 02:56:28,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 355 states have (on average 1.6) internal successors, (568), 361 states have internal predecessors, (568), 79 states have call successors, (79), 28 states have call predecessors, (79), 30 states have return successors, (85), 77 states have call predecessors, (85), 78 states have call successors, (85) [2024-10-11 02:56:28,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 732 transitions. [2024-10-11 02:56:28,848 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 732 transitions. Word has length 114 [2024-10-11 02:56:28,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:28,848 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 732 transitions. [2024-10-11 02:56:28,848 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.4) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (17), 2 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:56:28,848 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 732 transitions. [2024-10-11 02:56:28,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 02:56:28,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:28,850 INFO L215 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] [2024-10-11 02:56:28,867 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-11 02:56:29,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:56:29,051 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:29,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:29,052 INFO L85 PathProgramCache]: Analyzing trace with hash 803489515, now seen corresponding path program 1 times [2024-10-11 02:56:29,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:29,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73128099] [2024-10-11 02:56:29,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:29,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:29,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:29,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:29,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:29,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:29,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:29,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:29,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:29,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:29,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-10-11 02:56:29,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:29,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-10-11 02:56:29,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:29,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 02:56:29,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:29,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:56:29,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:29,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:56:29,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:29,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:56:29,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:29,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:56:29,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:29,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:56:29,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:29,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:56:29,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:29,216 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:56:29,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:29,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73128099] [2024-10-11 02:56:29,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73128099] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:29,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:29,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:56:29,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951772237] [2024-10-11 02:56:29,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:29,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:56:29,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:29,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:56:29,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:56:29,218 INFO L87 Difference]: Start difference. First operand 465 states and 732 transitions. Second operand has 9 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:56:30,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:30,925 INFO L93 Difference]: Finished difference Result 1016 states and 1632 transitions. [2024-10-11 02:56:30,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:56:30,926 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2024-10-11 02:56:30,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:30,931 INFO L225 Difference]: With dead ends: 1016 [2024-10-11 02:56:30,931 INFO L226 Difference]: Without dead ends: 570 [2024-10-11 02:56:30,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 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-10-11 02:56:30,937 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1435 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 2460 mSolverCounterSat, 512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1436 SdHoareTripleChecker+Valid, 1196 SdHoareTripleChecker+Invalid, 2972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 512 IncrementalHoareTripleChecker+Valid, 2460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:30,940 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1436 Valid, 1196 Invalid, 2972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [512 Valid, 2460 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 02:56:30,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-10-11 02:56:30,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 465. [2024-10-11 02:56:30,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 355 states have (on average 1.6) internal successors, (568), 361 states have internal predecessors, (568), 79 states have call successors, (79), 28 states have call predecessors, (79), 30 states have return successors, (84), 77 states have call predecessors, (84), 78 states have call successors, (84) [2024-10-11 02:56:30,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 731 transitions. [2024-10-11 02:56:30,968 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 731 transitions. Word has length 115 [2024-10-11 02:56:30,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:30,969 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 731 transitions. [2024-10-11 02:56:30,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.125) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:56:30,969 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 731 transitions. [2024-10-11 02:56:30,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-11 02:56:30,971 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:30,971 INFO L215 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] [2024-10-11 02:56:30,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 02:56:30,971 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:30,971 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:30,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1064291091, now seen corresponding path program 2 times [2024-10-11 02:56:30,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:30,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1898616433] [2024-10-11 02:56:30,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:30,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:31,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:31,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:31,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:31,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:31,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:31,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 02:56:31,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:31,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-11 02:56:31,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:31,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-11 02:56:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:31,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:56:31,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:31,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:56:31,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:31,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:56:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:31,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:56:31,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:31,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:56:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:31,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:56:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:31,155 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-10-11 02:56:31,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:31,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1898616433] [2024-10-11 02:56:31,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1898616433] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:31,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:31,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 02:56:31,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571022475] [2024-10-11 02:56:31,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:31,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 02:56:31,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:31,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 02:56:31,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 02:56:31,156 INFO L87 Difference]: Start difference. First operand 465 states and 731 transitions. Second operand has 9 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:56:32,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:32,812 INFO L93 Difference]: Finished difference Result 1018 states and 1635 transitions. [2024-10-11 02:56:32,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 02:56:32,813 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2024-10-11 02:56:32,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:32,820 INFO L225 Difference]: With dead ends: 1018 [2024-10-11 02:56:32,820 INFO L226 Difference]: Without dead ends: 572 [2024-10-11 02:56:32,822 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 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-10-11 02:56:32,824 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1411 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 2509 mSolverCounterSat, 502 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1412 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 3011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 502 IncrementalHoareTripleChecker+Valid, 2509 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:32,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1412 Valid, 1197 Invalid, 3011 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [502 Valid, 2509 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-11 02:56:32,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-10-11 02:56:32,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 467. [2024-10-11 02:56:32,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 356 states have (on average 1.598314606741573) internal successors, (569), 363 states have internal predecessors, (569), 79 states have call successors, (79), 28 states have call predecessors, (79), 31 states have return successors, (86), 77 states have call predecessors, (86), 78 states have call successors, (86) [2024-10-11 02:56:32,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 734 transitions. [2024-10-11 02:56:32,865 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 734 transitions. Word has length 116 [2024-10-11 02:56:32,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:32,866 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 734 transitions. [2024-10-11 02:56:32,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 9.25) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (17), 6 states have call predecessors, (17), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-11 02:56:32,866 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 734 transitions. [2024-10-11 02:56:32,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 02:56:32,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:32,868 INFO L215 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] [2024-10-11 02:56:32,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 02:56:32,868 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:32,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:32,869 INFO L85 PathProgramCache]: Analyzing trace with hash -587191632, now seen corresponding path program 1 times [2024-10-11 02:56:32,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:32,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185606233] [2024-10-11 02:56:32,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:32,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:32,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:32,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:33,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:33,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:33,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-10-11 02:56:33,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 02:56:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:56:33,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:56:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:56:33,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:56:33,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:56:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:56:33,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:33,090 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:56:33,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:33,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185606233] [2024-10-11 02:56:33,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185606233] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:33,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:33,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:56:33,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393747226] [2024-10-11 02:56:33,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:33,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:56:33,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:33,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:56:33,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:56:33,092 INFO L87 Difference]: Start difference. First operand 467 states and 734 transitions. Second operand has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-11 02:56:35,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:35,197 INFO L93 Difference]: Finished difference Result 1016 states and 1630 transitions. [2024-10-11 02:56:35,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:56:35,198 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 117 [2024-10-11 02:56:35,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:35,202 INFO L225 Difference]: With dead ends: 1016 [2024-10-11 02:56:35,202 INFO L226 Difference]: Without dead ends: 572 [2024-10-11 02:56:35,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 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-10-11 02:56:35,204 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 1419 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 4209 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1420 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 4727 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 4209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:35,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1420 Valid, 1663 Invalid, 4727 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 4209 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 02:56:35,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2024-10-11 02:56:35,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 467. [2024-10-11 02:56:35,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 356 states have (on average 1.598314606741573) internal successors, (569), 363 states have internal predecessors, (569), 79 states have call successors, (79), 28 states have call predecessors, (79), 31 states have return successors, (85), 77 states have call predecessors, (85), 78 states have call successors, (85) [2024-10-11 02:56:35,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 733 transitions. [2024-10-11 02:56:35,236 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 733 transitions. Word has length 117 [2024-10-11 02:56:35,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:35,236 INFO L471 AbstractCegarLoop]: Abstraction has 467 states and 733 transitions. [2024-10-11 02:56:35,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.090909090909091) internal successors, (78), 8 states have internal predecessors, (78), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-11 02:56:35,236 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 733 transitions. [2024-10-11 02:56:35,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 02:56:35,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:35,242 INFO L215 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] [2024-10-11 02:56:35,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 02:56:35,243 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:35,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:35,243 INFO L85 PathProgramCache]: Analyzing trace with hash -1409350585, now seen corresponding path program 2 times [2024-10-11 02:56:35,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:35,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226323699] [2024-10-11 02:56:35,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:35,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:35,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:35,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:35,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:35,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:35,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:35,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:35,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:35,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:35,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:35,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:35,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:35,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:35,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 02:56:35,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:35,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:56:35,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:35,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:56:35,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:35,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:56:35,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:35,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:56:35,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:35,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:56:35,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:35,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:56:35,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:35,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:56:35,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:35,460 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 02:56:35,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:35,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226323699] [2024-10-11 02:56:35,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226323699] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:35,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:35,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 02:56:35,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371034038] [2024-10-11 02:56:35,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:35,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 02:56:35,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:35,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 02:56:35,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-11 02:56:35,462 INFO L87 Difference]: Start difference. First operand 467 states and 733 transitions. Second operand has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-11 02:56:37,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:37,514 INFO L93 Difference]: Finished difference Result 1018 states and 1636 transitions. [2024-10-11 02:56:37,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 02:56:37,515 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 118 [2024-10-11 02:56:37,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:37,519 INFO L225 Difference]: With dead ends: 1018 [2024-10-11 02:56:37,519 INFO L226 Difference]: Without dead ends: 574 [2024-10-11 02:56:37,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 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-10-11 02:56:37,521 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1360 mSDsluCounter, 1472 mSDsCounter, 0 mSdLazyCounter, 4451 mSolverCounterSat, 483 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1361 SdHoareTripleChecker+Valid, 1665 SdHoareTripleChecker+Invalid, 4934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 483 IncrementalHoareTripleChecker+Valid, 4451 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:37,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1361 Valid, 1665 Invalid, 4934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [483 Valid, 4451 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 02:56:37,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2024-10-11 02:56:37,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 469. [2024-10-11 02:56:37,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 357 states have (on average 1.596638655462185) internal successors, (570), 365 states have internal predecessors, (570), 79 states have call successors, (79), 28 states have call predecessors, (79), 32 states have return successors, (90), 77 states have call predecessors, (90), 78 states have call successors, (90) [2024-10-11 02:56:37,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 739 transitions. [2024-10-11 02:56:37,548 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 739 transitions. Word has length 118 [2024-10-11 02:56:37,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:37,549 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 739 transitions. [2024-10-11 02:56:37,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 8 states have internal predecessors, (79), 4 states have call successors, (17), 6 states have call predecessors, (17), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-11 02:56:37,549 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 739 transitions. [2024-10-11 02:56:37,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 02:56:37,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:37,551 INFO L215 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] [2024-10-11 02:56:37,551 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 02:56:37,551 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:37,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:37,551 INFO L85 PathProgramCache]: Analyzing trace with hash -525874987, now seen corresponding path program 1 times [2024-10-11 02:56:37,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:37,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919986575] [2024-10-11 02:56:37,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:37,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:37,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:37,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:37,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:37,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:37,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:37,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-11 02:56:37,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:56:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:56:37,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:56:37,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:56:37,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:56:37,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:56:37,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 02:56:37,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,755 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-10-11 02:56:37,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:37,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919986575] [2024-10-11 02:56:37,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919986575] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 02:56:37,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237128915] [2024-10-11 02:56:37,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:37,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 02:56:37,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 02:56:37,757 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 02:56:37,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 02:56:37,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:37,982 INFO L255 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 02:56:37,985 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 02:56:38,013 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:38,014 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 02:56:38,096 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:38,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237128915] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 02:56:38,097 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 02:56:38,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-10-11 02:56:38,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373732489] [2024-10-11 02:56:38,097 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 02:56:38,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 02:56:38,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:38,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 02:56:38,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-10-11 02:56:38,100 INFO L87 Difference]: Start difference. First operand 469 states and 739 transitions. Second operand has 15 states, 14 states have (on average 9.357142857142858) internal successors, (131), 11 states have internal predecessors, (131), 4 states have call successors, (34), 6 states have call predecessors, (34), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2024-10-11 02:56:40,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:40,329 INFO L93 Difference]: Finished difference Result 1437 states and 2412 transitions. [2024-10-11 02:56:40,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 02:56:40,330 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 9.357142857142858) internal successors, (131), 11 states have internal predecessors, (131), 4 states have call successors, (34), 6 states have call predecessors, (34), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) Word has length 119 [2024-10-11 02:56:40,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:40,335 INFO L225 Difference]: With dead ends: 1437 [2024-10-11 02:56:40,335 INFO L226 Difference]: Without dead ends: 994 [2024-10-11 02:56:40,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2024-10-11 02:56:40,337 INFO L432 NwaCegarLoop]: 177 mSDtfsCounter, 2884 mSDsluCounter, 1633 mSDsCounter, 0 mSdLazyCounter, 4062 mSolverCounterSat, 922 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2904 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 4984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 922 IncrementalHoareTripleChecker+Valid, 4062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:40,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2904 Valid, 1810 Invalid, 4984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [922 Valid, 4062 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-10-11 02:56:40,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 994 states. [2024-10-11 02:56:40,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 994 to 874. [2024-10-11 02:56:40,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 874 states, 683 states have (on average 1.644216691068814) internal successors, (1123), 691 states have internal predecessors, (1123), 158 states have call successors, (158), 28 states have call predecessors, (158), 32 states have return successors, (179), 156 states have call predecessors, (179), 157 states have call successors, (179) [2024-10-11 02:56:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1460 transitions. [2024-10-11 02:56:40,392 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1460 transitions. Word has length 119 [2024-10-11 02:56:40,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:40,393 INFO L471 AbstractCegarLoop]: Abstraction has 874 states and 1460 transitions. [2024-10-11 02:56:40,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 9.357142857142858) internal successors, (131), 11 states have internal predecessors, (131), 4 states have call successors, (34), 6 states have call predecessors, (34), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2024-10-11 02:56:40,394 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1460 transitions. [2024-10-11 02:56:40,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 02:56:40,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:40,398 INFO L215 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] [2024-10-11 02:56:40,414 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-11 02:56:40,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2024-10-11 02:56:40,599 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:40,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:40,600 INFO L85 PathProgramCache]: Analyzing trace with hash -2089149145, now seen corresponding path program 1 times [2024-10-11 02:56:40,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:40,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956077811] [2024-10-11 02:56:40,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:40,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:40,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:40,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:40,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:40,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:40,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:40,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:40,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:40,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:40,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:40,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:40,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:40,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-10-11 02:56:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:40,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:56:40,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:40,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:56:40,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:40,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:56:40,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:40,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:56:40,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:40,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:56:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:40,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-11 02:56:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:40,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:56:40,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:40,691 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:40,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:40,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956077811] [2024-10-11 02:56:40,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956077811] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:40,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:40,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:40,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409679510] [2024-10-11 02:56:40,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:40,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:40,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:40,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:40,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:40,693 INFO L87 Difference]: Start difference. First operand 874 states and 1460 transitions. Second operand has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:41,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:41,948 INFO L93 Difference]: Finished difference Result 2172 states and 3731 transitions. [2024-10-11 02:56:41,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:41,948 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 123 [2024-10-11 02:56:41,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:41,955 INFO L225 Difference]: With dead ends: 2172 [2024-10-11 02:56:41,956 INFO L226 Difference]: Without dead ends: 1366 [2024-10-11 02:56:41,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-10-11 02:56:41,959 INFO L432 NwaCegarLoop]: 210 mSDtfsCounter, 1494 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 1480 mSolverCounterSat, 571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1512 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 2051 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 571 IncrementalHoareTripleChecker+Valid, 1480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:41,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1512 Valid, 914 Invalid, 2051 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [571 Valid, 1480 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 02:56:41,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1366 states. [2024-10-11 02:56:42,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1366 to 1256. [2024-10-11 02:56:42,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 986 states have (on average 1.658215010141988) internal successors, (1635), 994 states have internal predecessors, (1635), 237 states have call successors, (237), 28 states have call predecessors, (237), 32 states have return successors, (268), 235 states have call predecessors, (268), 236 states have call successors, (268) [2024-10-11 02:56:42,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2140 transitions. [2024-10-11 02:56:42,012 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2140 transitions. Word has length 123 [2024-10-11 02:56:42,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:42,013 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 2140 transitions. [2024-10-11 02:56:42,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.285714285714286) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:42,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2140 transitions. [2024-10-11 02:56:42,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 02:56:42,018 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:42,018 INFO L215 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] [2024-10-11 02:56:42,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 02:56:42,018 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:42,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:42,019 INFO L85 PathProgramCache]: Analyzing trace with hash -946751994, now seen corresponding path program 1 times [2024-10-11 02:56:42,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:42,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192575399] [2024-10-11 02:56:42,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:42,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:42,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:42,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:42,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:42,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:42,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:42,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:42,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:42,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:42,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 02:56:42,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:42,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:56:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:42,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:56:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:42,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:56:42,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:42,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:56:42,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:42,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:56:42,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:42,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-11 02:56:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:42,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 02:56:42,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:42,114 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:42,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:42,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192575399] [2024-10-11 02:56:42,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192575399] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:42,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:42,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:42,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919373074] [2024-10-11 02:56:42,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:42,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:42,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:42,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:42,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:42,116 INFO L87 Difference]: Start difference. First operand 1256 states and 2140 transitions. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:43,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:43,268 INFO L93 Difference]: Finished difference Result 3123 states and 5417 transitions. [2024-10-11 02:56:43,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:43,269 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 124 [2024-10-11 02:56:43,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:43,278 INFO L225 Difference]: With dead ends: 3123 [2024-10-11 02:56:43,279 INFO L226 Difference]: Without dead ends: 1985 [2024-10-11 02:56:43,282 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-10-11 02:56:43,283 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1521 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 1426 mSolverCounterSat, 566 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1540 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 1992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 566 IncrementalHoareTripleChecker+Valid, 1426 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:43,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1540 Valid, 882 Invalid, 1992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [566 Valid, 1426 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:56:43,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1985 states. [2024-10-11 02:56:43,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1985 to 1875. [2024-10-11 02:56:43,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1875 states, 1486 states have (on average 1.6655450874831763) internal successors, (2475), 1494 states have internal predecessors, (2475), 356 states have call successors, (356), 28 states have call predecessors, (356), 32 states have return successors, (387), 354 states have call predecessors, (387), 355 states have call successors, (387) [2024-10-11 02:56:43,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1875 states to 1875 states and 3218 transitions. [2024-10-11 02:56:43,356 INFO L78 Accepts]: Start accepts. Automaton has 1875 states and 3218 transitions. Word has length 124 [2024-10-11 02:56:43,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:43,357 INFO L471 AbstractCegarLoop]: Abstraction has 1875 states and 3218 transitions. [2024-10-11 02:56:43,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:43,357 INFO L276 IsEmpty]: Start isEmpty. Operand 1875 states and 3218 transitions. [2024-10-11 02:56:43,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-10-11 02:56:43,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:43,365 INFO L215 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] [2024-10-11 02:56:43,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 02:56:43,365 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:43,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:43,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1533439829, now seen corresponding path program 1 times [2024-10-11 02:56:43,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:43,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687202708] [2024-10-11 02:56:43,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:43,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:43,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:43,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:43,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:43,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:43,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:43,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:43,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-11 02:56:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:56:43,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:56:43,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:56:43,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-11 02:56:43,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:56:43,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-11 02:56:43,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 02:56:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:43,460 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:43,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:43,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687202708] [2024-10-11 02:56:43,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687202708] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:43,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:43,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:43,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369186777] [2024-10-11 02:56:43,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:43,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:43,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:43,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:43,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:43,487 INFO L87 Difference]: Start difference. First operand 1875 states and 3218 transitions. Second operand has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:44,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:44,560 INFO L93 Difference]: Finished difference Result 4563 states and 7988 transitions. [2024-10-11 02:56:44,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:44,561 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 125 [2024-10-11 02:56:44,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:44,573 INFO L225 Difference]: With dead ends: 4563 [2024-10-11 02:56:44,574 INFO L226 Difference]: Without dead ends: 2934 [2024-10-11 02:56:44,579 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-10-11 02:56:44,580 INFO L432 NwaCegarLoop]: 198 mSDtfsCounter, 1496 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1464 mSolverCounterSat, 558 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1514 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 2022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 558 IncrementalHoareTripleChecker+Valid, 1464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:44,580 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1514 Valid, 879 Invalid, 2022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [558 Valid, 1464 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:56:44,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2934 states. [2024-10-11 02:56:44,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2934 to 2824. [2024-10-11 02:56:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2824 states, 2273 states have (on average 1.6717993840739112) internal successors, (3800), 2281 states have internal predecessors, (3800), 518 states have call successors, (518), 28 states have call predecessors, (518), 32 states have return successors, (565), 516 states have call predecessors, (565), 517 states have call successors, (565) [2024-10-11 02:56:44,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2824 states to 2824 states and 4883 transitions. [2024-10-11 02:56:44,723 INFO L78 Accepts]: Start accepts. Automaton has 2824 states and 4883 transitions. Word has length 125 [2024-10-11 02:56:44,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:44,723 INFO L471 AbstractCegarLoop]: Abstraction has 2824 states and 4883 transitions. [2024-10-11 02:56:44,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.571428571428571) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:44,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2824 states and 4883 transitions. [2024-10-11 02:56:44,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-10-11 02:56:44,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:44,736 INFO L215 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] [2024-10-11 02:56:44,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 02:56:44,736 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:44,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:44,736 INFO L85 PathProgramCache]: Analyzing trace with hash -560475897, now seen corresponding path program 1 times [2024-10-11 02:56:44,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:44,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399514894] [2024-10-11 02:56:44,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:44,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:44,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:44,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:44,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:44,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:44,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:44,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:44,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:44,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:44,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:44,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:44,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:44,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:44,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 02:56:44,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:44,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:56:44,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:44,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-10-11 02:56:44,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:44,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-11 02:56:44,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:44,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-10-11 02:56:44,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:44,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:56:44,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:44,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-10-11 02:56:44,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:44,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 02:56:44,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:44,845 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:44,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:44,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399514894] [2024-10-11 02:56:44,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399514894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:44,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:44,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:44,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1544807181] [2024-10-11 02:56:44,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:44,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:44,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:44,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:44,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:44,847 INFO L87 Difference]: Start difference. First operand 2824 states and 4883 transitions. Second operand has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:46,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:46,150 INFO L93 Difference]: Finished difference Result 6835 states and 12056 transitions. [2024-10-11 02:56:46,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:46,150 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 126 [2024-10-11 02:56:46,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:46,167 INFO L225 Difference]: With dead ends: 6835 [2024-10-11 02:56:46,167 INFO L226 Difference]: Without dead ends: 4466 [2024-10-11 02:56:46,172 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-10-11 02:56:46,173 INFO L432 NwaCegarLoop]: 192 mSDtfsCounter, 1521 mSDsluCounter, 680 mSDsCounter, 0 mSdLazyCounter, 1416 mSolverCounterSat, 550 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1539 SdHoareTripleChecker+Valid, 872 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 550 IncrementalHoareTripleChecker+Valid, 1416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:46,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1539 Valid, 872 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [550 Valid, 1416 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-11 02:56:46,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4466 states. [2024-10-11 02:56:46,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4466 to 4356. [2024-10-11 02:56:46,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4356 states, 3560 states have (on average 1.6764044943820224) internal successors, (5968), 3568 states have internal predecessors, (5968), 763 states have call successors, (763), 28 states have call predecessors, (763), 32 states have return successors, (836), 761 states have call predecessors, (836), 762 states have call successors, (836) [2024-10-11 02:56:46,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4356 states to 4356 states and 7567 transitions. [2024-10-11 02:56:46,309 INFO L78 Accepts]: Start accepts. Automaton has 4356 states and 7567 transitions. Word has length 126 [2024-10-11 02:56:46,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:46,309 INFO L471 AbstractCegarLoop]: Abstraction has 4356 states and 7567 transitions. [2024-10-11 02:56:46,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.714285714285714) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:46,309 INFO L276 IsEmpty]: Start isEmpty. Operand 4356 states and 7567 transitions. [2024-10-11 02:56:46,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-10-11 02:56:46,321 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:46,321 INFO L215 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] [2024-10-11 02:56:46,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 02:56:46,321 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:46,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:46,322 INFO L85 PathProgramCache]: Analyzing trace with hash 506689457, now seen corresponding path program 1 times [2024-10-11 02:56:46,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:46,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343345269] [2024-10-11 02:56:46,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:46,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:46,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:46,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:46,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:46,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:46,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:46,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:46,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:46,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:46,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:46,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-11 02:56:46,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:46,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:56:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:46,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-10-11 02:56:46,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:46,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-10-11 02:56:46,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:46,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-10-11 02:56:46,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:46,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:56:46,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:46,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-10-11 02:56:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:46,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 02:56:46,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:46,406 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:46,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:46,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343345269] [2024-10-11 02:56:46,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343345269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:46,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:46,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:46,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1565658768] [2024-10-11 02:56:46,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:46,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:46,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:46,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:46,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:46,408 INFO L87 Difference]: Start difference. First operand 4356 states and 7567 transitions. Second operand has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:47,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:47,621 INFO L93 Difference]: Finished difference Result 10888 states and 19267 transitions. [2024-10-11 02:56:47,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:47,622 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 127 [2024-10-11 02:56:47,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:47,653 INFO L225 Difference]: With dead ends: 10888 [2024-10-11 02:56:47,653 INFO L226 Difference]: Without dead ends: 7226 [2024-10-11 02:56:47,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-10-11 02:56:47,665 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1499 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1463 mSolverCounterSat, 560 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1517 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 2023 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 560 IncrementalHoareTripleChecker+Valid, 1463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:47,666 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1517 Valid, 886 Invalid, 2023 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [560 Valid, 1463 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:56:47,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7226 states. [2024-10-11 02:56:47,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7226 to 7116. [2024-10-11 02:56:47,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7116 states, 5827 states have (on average 1.6722155483095933) internal successors, (9744), 5835 states have internal predecessors, (9744), 1256 states have call successors, (1256), 28 states have call predecessors, (1256), 32 states have return successors, (1373), 1254 states have call predecessors, (1373), 1255 states have call successors, (1373) [2024-10-11 02:56:47,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7116 states to 7116 states and 12373 transitions. [2024-10-11 02:56:47,946 INFO L78 Accepts]: Start accepts. Automaton has 7116 states and 12373 transitions. Word has length 127 [2024-10-11 02:56:47,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:47,947 INFO L471 AbstractCegarLoop]: Abstraction has 7116 states and 12373 transitions. [2024-10-11 02:56:47,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.857142857142858) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:47,947 INFO L276 IsEmpty]: Start isEmpty. Operand 7116 states and 12373 transitions. [2024-10-11 02:56:47,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-11 02:56:47,965 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:47,965 INFO L215 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] [2024-10-11 02:56:47,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 02:56:47,965 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:47,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:47,966 INFO L85 PathProgramCache]: Analyzing trace with hash -1690623829, now seen corresponding path program 1 times [2024-10-11 02:56:47,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:47,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977722747] [2024-10-11 02:56:47,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:47,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:47,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:48,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:48,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:48,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:48,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:48,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:48,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:48,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:48,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:48,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:48,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:48,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 02:56:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:48,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:56:48,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:48,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-11 02:56:48,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:48,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-11 02:56:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:48,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-11 02:56:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:48,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-11 02:56:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:48,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-10-11 02:56:48,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:48,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-11 02:56:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:48,044 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:48,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:48,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977722747] [2024-10-11 02:56:48,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977722747] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:48,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:48,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:48,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326082915] [2024-10-11 02:56:48,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:48,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:48,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:48,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:48,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:48,047 INFO L87 Difference]: Start difference. First operand 7116 states and 12373 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:49,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:49,389 INFO L93 Difference]: Finished difference Result 18091 states and 32014 transitions. [2024-10-11 02:56:49,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:49,390 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 128 [2024-10-11 02:56:49,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:49,438 INFO L225 Difference]: With dead ends: 18091 [2024-10-11 02:56:49,438 INFO L226 Difference]: Without dead ends: 12055 [2024-10-11 02:56:49,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-10-11 02:56:49,456 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1478 mSDsluCounter, 685 mSDsCounter, 0 mSdLazyCounter, 1431 mSolverCounterSat, 565 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1497 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 1996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 565 IncrementalHoareTripleChecker+Valid, 1431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:49,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1497 Valid, 878 Invalid, 1996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [565 Valid, 1431 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:56:49,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12055 states. [2024-10-11 02:56:49,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12055 to 11945. [2024-10-11 02:56:49,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11945 states, 9834 states have (on average 1.6722595078299776) internal successors, (16445), 9842 states have internal predecessors, (16445), 2078 states have call successors, (2078), 28 states have call predecessors, (2078), 32 states have return successors, (2273), 2076 states have call predecessors, (2273), 2077 states have call successors, (2273) [2024-10-11 02:56:49,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11945 states to 11945 states and 20796 transitions. [2024-10-11 02:56:49,847 INFO L78 Accepts]: Start accepts. Automaton has 11945 states and 20796 transitions. Word has length 128 [2024-10-11 02:56:49,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:49,849 INFO L471 AbstractCegarLoop]: Abstraction has 11945 states and 20796 transitions. [2024-10-11 02:56:49,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:49,850 INFO L276 IsEmpty]: Start isEmpty. Operand 11945 states and 20796 transitions. [2024-10-11 02:56:49,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-11 02:56:49,875 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:49,875 INFO L215 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] [2024-10-11 02:56:49,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 02:56:49,876 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:49,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:49,876 INFO L85 PathProgramCache]: Analyzing trace with hash 1561264851, now seen corresponding path program 1 times [2024-10-11 02:56:49,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:49,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [768909236] [2024-10-11 02:56:49,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:49,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:49,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:49,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:49,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-10-11 02:56:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-10-11 02:56:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 02:56:49,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-10-11 02:56:49,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-10-11 02:56:49,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-10-11 02:56:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-11 02:56:49,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-11 02:56:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:49,976 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:49,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:49,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [768909236] [2024-10-11 02:56:49,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [768909236] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:49,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:49,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:49,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512498053] [2024-10-11 02:56:49,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:49,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:49,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:49,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:49,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:49,978 INFO L87 Difference]: Start difference. First operand 11945 states and 20796 transitions. Second operand has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:51,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:51,361 INFO L93 Difference]: Finished difference Result 28637 states and 50462 transitions. [2024-10-11 02:56:51,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:51,362 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 129 [2024-10-11 02:56:51,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:51,422 INFO L225 Difference]: With dead ends: 28637 [2024-10-11 02:56:51,422 INFO L226 Difference]: Without dead ends: 18727 [2024-10-11 02:56:51,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-10-11 02:56:51,447 INFO L432 NwaCegarLoop]: 194 mSDtfsCounter, 1550 mSDsluCounter, 656 mSDsCounter, 0 mSdLazyCounter, 1385 mSolverCounterSat, 576 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1569 SdHoareTripleChecker+Valid, 850 SdHoareTripleChecker+Invalid, 1961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 576 IncrementalHoareTripleChecker+Valid, 1385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:51,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1569 Valid, 850 Invalid, 1961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [576 Valid, 1385 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 02:56:51,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18727 states. [2024-10-11 02:56:52,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18727 to 18617. [2024-10-11 02:56:52,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18617 states, 15303 states have (on average 1.6489577207083579) internal successors, (25234), 15311 states have internal predecessors, (25234), 3281 states have call successors, (3281), 28 states have call predecessors, (3281), 32 states have return successors, (3620), 3279 states have call predecessors, (3620), 3280 states have call successors, (3620) [2024-10-11 02:56:52,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18617 states to 18617 states and 32135 transitions. [2024-10-11 02:56:52,189 INFO L78 Accepts]: Start accepts. Automaton has 18617 states and 32135 transitions. Word has length 129 [2024-10-11 02:56:52,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:52,189 INFO L471 AbstractCegarLoop]: Abstraction has 18617 states and 32135 transitions. [2024-10-11 02:56:52,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.142857142857142) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:52,190 INFO L276 IsEmpty]: Start isEmpty. Operand 18617 states and 32135 transitions. [2024-10-11 02:56:52,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-11 02:56:52,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:52,211 INFO L215 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] [2024-10-11 02:56:52,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 02:56:52,212 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:52,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:52,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1388711756, now seen corresponding path program 1 times [2024-10-11 02:56:52,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:52,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462309655] [2024-10-11 02:56:52,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:52,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:52,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:52,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:52,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:52,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:52,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:52,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:52,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:52,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:52,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:52,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:52,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:52,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:52,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 02:56:52,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:52,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-11 02:56:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:52,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-10-11 02:56:52,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:52,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-10-11 02:56:52,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:52,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-11 02:56:52,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:52,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-11 02:56:52,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:52,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-11 02:56:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:52,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-10-11 02:56:52,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:52,302 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:52,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:52,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462309655] [2024-10-11 02:56:52,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462309655] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:52,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:52,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:52,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246437067] [2024-10-11 02:56:52,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:52,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:52,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:52,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:52,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:52,303 INFO L87 Difference]: Start difference. First operand 18617 states and 32135 transitions. Second operand has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:54,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:54,148 INFO L93 Difference]: Finished difference Result 49270 states and 86581 transitions. [2024-10-11 02:56:54,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:54,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2024-10-11 02:56:54,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:54,248 INFO L225 Difference]: With dead ends: 49270 [2024-10-11 02:56:54,249 INFO L226 Difference]: Without dead ends: 33308 [2024-10-11 02:56:54,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-10-11 02:56:54,287 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1552 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 1396 mSolverCounterSat, 599 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1572 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 1995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 599 IncrementalHoareTripleChecker+Valid, 1396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:54,287 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1572 Valid, 878 Invalid, 1995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [599 Valid, 1396 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:56:54,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33308 states. [2024-10-11 02:56:55,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33308 to 33198. [2024-10-11 02:56:55,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33198 states, 27434 states have (on average 1.6461325362688635) internal successors, (45160), 27442 states have internal predecessors, (45160), 5731 states have call successors, (5731), 28 states have call predecessors, (5731), 32 states have return successors, (6344), 5729 states have call predecessors, (6344), 5730 states have call successors, (6344) [2024-10-11 02:56:55,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33198 states to 33198 states and 57235 transitions. [2024-10-11 02:56:55,566 INFO L78 Accepts]: Start accepts. Automaton has 33198 states and 57235 transitions. Word has length 130 [2024-10-11 02:56:55,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:56:55,568 INFO L471 AbstractCegarLoop]: Abstraction has 33198 states and 57235 transitions. [2024-10-11 02:56:55,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.285714285714286) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:55,569 INFO L276 IsEmpty]: Start isEmpty. Operand 33198 states and 57235 transitions. [2024-10-11 02:56:55,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-10-11 02:56:55,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:56:55,603 INFO L215 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] [2024-10-11 02:56:55,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 02:56:55,603 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:56:55,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:56:55,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1644184819, now seen corresponding path program 1 times [2024-10-11 02:56:55,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:56:55,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201247242] [2024-10-11 02:56:55,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:56:55,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:56:55,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:56:55,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:56:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:56:55,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:56:55,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:56:55,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:56:55,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-11 02:56:55,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 02:56:55,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-11 02:56:55,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-11 02:56:55,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-10-11 02:56:55,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-10-11 02:56:55,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-10-11 02:56:55,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-10-11 02:56:55,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:56:55,704 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:56:55,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:56:55,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201247242] [2024-10-11 02:56:55,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201247242] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:56:55,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:56:55,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:56:55,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296986244] [2024-10-11 02:56:55,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:56:55,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:56:55,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:56:55,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:56:55,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:56:55,706 INFO L87 Difference]: Start difference. First operand 33198 states and 57235 transitions. Second operand has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:56:58,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:56:58,285 INFO L93 Difference]: Finished difference Result 90572 states and 158410 transitions. [2024-10-11 02:56:58,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:56:58,287 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 131 [2024-10-11 02:56:58,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:56:58,496 INFO L225 Difference]: With dead ends: 90572 [2024-10-11 02:56:58,497 INFO L226 Difference]: Without dead ends: 60920 [2024-10-11 02:56:58,567 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-10-11 02:56:58,568 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 1486 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 1447 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 874 SdHoareTripleChecker+Invalid, 1995 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:56:58,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 874 Invalid, 1995 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1447 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:56:58,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60920 states. [2024-10-11 02:57:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60920 to 60810. [2024-10-11 02:57:00,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60810 states, 50533 states have (on average 1.6422931549680406) internal successors, (82990), 50541 states have internal predecessors, (82990), 10244 states have call successors, (10244), 28 states have call predecessors, (10244), 32 states have return successors, (11389), 10242 states have call predecessors, (11389), 10243 states have call successors, (11389) [2024-10-11 02:57:01,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60810 states to 60810 states and 104623 transitions. [2024-10-11 02:57:01,095 INFO L78 Accepts]: Start accepts. Automaton has 60810 states and 104623 transitions. Word has length 131 [2024-10-11 02:57:01,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:01,096 INFO L471 AbstractCegarLoop]: Abstraction has 60810 states and 104623 transitions. [2024-10-11 02:57:01,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.428571428571429) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:57:01,096 INFO L276 IsEmpty]: Start isEmpty. Operand 60810 states and 104623 transitions. [2024-10-11 02:57:01,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-10-11 02:57:01,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:01,315 INFO L215 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] [2024-10-11 02:57:01,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 02:57:01,315 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:01,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:01,315 INFO L85 PathProgramCache]: Analyzing trace with hash -622291508, now seen corresponding path program 1 times [2024-10-11 02:57:01,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:01,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045075727] [2024-10-11 02:57:01,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:01,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:01,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:01,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:57:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:01,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:57:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:01,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:57:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:01,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:57:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:01,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:57:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:01,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:57:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:01,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 02:57:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:01,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 02:57:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:01,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-10-11 02:57:01,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:01,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-10-11 02:57:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:01,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-10-11 02:57:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:01,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-10-11 02:57:01,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:01,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-10-11 02:57:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:01,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-10-11 02:57:01,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:01,402 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:57:01,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:01,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045075727] [2024-10-11 02:57:01,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045075727] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:01,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:01,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 02:57:01,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361628591] [2024-10-11 02:57:01,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:01,403 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 02:57:01,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:01,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 02:57:01,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 02:57:01,404 INFO L87 Difference]: Start difference. First operand 60810 states and 104623 transitions. Second operand has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:57:04,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:57:04,597 INFO L93 Difference]: Finished difference Result 113924 states and 199763 transitions. [2024-10-11 02:57:04,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 02:57:04,597 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2024-10-11 02:57:04,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:57:05,068 INFO L225 Difference]: With dead ends: 113924 [2024-10-11 02:57:05,068 INFO L226 Difference]: Without dead ends: 113714 [2024-10-11 02:57:05,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 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-10-11 02:57:05,108 INFO L432 NwaCegarLoop]: 196 mSDtfsCounter, 1545 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 1376 mSolverCounterSat, 586 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1563 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 586 IncrementalHoareTripleChecker+Valid, 1376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-11 02:57:05,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1563 Valid, 885 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [586 Valid, 1376 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-11 02:57:05,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113714 states. [2024-10-11 02:57:08,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113714 to 113604. [2024-10-11 02:57:08,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113604 states, 94959 states have (on average 1.637327688792005) internal successors, (155479), 94967 states have internal predecessors, (155479), 18612 states have call successors, (18612), 28 states have call predecessors, (18612), 32 states have return successors, (20803), 18610 states have call predecessors, (20803), 18611 states have call successors, (20803) [2024-10-11 02:57:09,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113604 states to 113604 states and 194894 transitions. [2024-10-11 02:57:09,311 INFO L78 Accepts]: Start accepts. Automaton has 113604 states and 194894 transitions. Word has length 132 [2024-10-11 02:57:09,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:09,312 INFO L471 AbstractCegarLoop]: Abstraction has 113604 states and 194894 transitions. [2024-10-11 02:57:09,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.571428571428571) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (17), 6 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 02:57:09,312 INFO L276 IsEmpty]: Start isEmpty. Operand 113604 states and 194894 transitions. [2024-10-11 02:57:09,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-10-11 02:57:09,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:09,351 INFO L215 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] [2024-10-11 02:57:09,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 02:57:09,351 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:09,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:09,352 INFO L85 PathProgramCache]: Analyzing trace with hash -1215253268, now seen corresponding path program 1 times [2024-10-11 02:57:09,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:09,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464949865] [2024-10-11 02:57:09,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:09,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:09,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:09,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:57:09,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:09,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:57:09,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:09,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:57:09,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:09,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:57:09,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:09,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:57:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:09,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:57:09,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:09,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:57:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:09,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:57:09,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:10,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:57:10,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:10,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:57:10,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:10,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:57:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:10,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:57:10,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:10,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-10-11 02:57:10,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:10,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-10-11 02:57:10,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:10,048 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:57:10,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:10,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464949865] [2024-10-11 02:57:10,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464949865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:10,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:10,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-11 02:57:10,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804808254] [2024-10-11 02:57:10,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:10,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 02:57:10,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:10,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 02:57:10,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=267, Unknown=0, NotChecked=0, Total=306 [2024-10-11 02:57:10,050 INFO L87 Difference]: Start difference. First operand 113604 states and 194894 transitions. Second operand has 18 states, 16 states have (on average 5.5625) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2024-10-11 02:57:20,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 02:57:20,109 INFO L93 Difference]: Finished difference Result 226852 states and 401216 transitions. [2024-10-11 02:57:20,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-10-11 02:57:20,109 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 5.5625) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 133 [2024-10-11 02:57:20,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 02:57:21,076 INFO L225 Difference]: With dead ends: 226852 [2024-10-11 02:57:21,077 INFO L226 Difference]: Without dead ends: 226647 [2024-10-11 02:57:21,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1460 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=863, Invalid=3967, Unknown=0, NotChecked=0, Total=4830 [2024-10-11 02:57:21,163 INFO L432 NwaCegarLoop]: 243 mSDtfsCounter, 5434 mSDsluCounter, 2492 mSDsCounter, 0 mSdLazyCounter, 8246 mSolverCounterSat, 2093 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5448 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 10339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2093 IncrementalHoareTripleChecker+Valid, 8246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-10-11 02:57:21,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5448 Valid, 2735 Invalid, 10339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2093 Valid, 8246 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-10-11 02:57:21,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226647 states. [2024-10-11 02:57:28,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226647 to 226254. [2024-10-11 02:57:28,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226254 states, 189161 states have (on average 1.6379221932639392) internal successors, (309831), 189071 states have internal predecessors, (309831), 37006 states have call successors, (37006), 75 states have call predecessors, (37006), 86 states have return successors, (44687), 37115 states have call predecessors, (44687), 37003 states have call successors, (44687) [2024-10-11 02:57:30,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226254 states to 226254 states and 391524 transitions. [2024-10-11 02:57:30,062 INFO L78 Accepts]: Start accepts. Automaton has 226254 states and 391524 transitions. Word has length 133 [2024-10-11 02:57:30,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 02:57:30,062 INFO L471 AbstractCegarLoop]: Abstraction has 226254 states and 391524 transitions. [2024-10-11 02:57:30,062 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 5.5625) internal successors, (89), 12 states have internal predecessors, (89), 6 states have call successors, (17), 7 states have call predecessors, (17), 4 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2024-10-11 02:57:30,062 INFO L276 IsEmpty]: Start isEmpty. Operand 226254 states and 391524 transitions. [2024-10-11 02:57:30,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-10-11 02:57:30,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 02:57:30,136 INFO L215 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] [2024-10-11 02:57:30,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 02:57:30,136 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 02:57:30,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 02:57:30,136 INFO L85 PathProgramCache]: Analyzing trace with hash -982348806, now seen corresponding path program 1 times [2024-10-11 02:57:30,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 02:57:30,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869491989] [2024-10-11 02:57:30,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 02:57:30,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 02:57:30,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:30,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 02:57:30,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:30,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 02:57:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:30,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 02:57:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:30,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-10-11 02:57:30,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:30,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-10-11 02:57:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:30,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 02:57:30,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:30,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-11 02:57:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:30,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-11 02:57:30,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:30,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-11 02:57:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:30,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-10-11 02:57:30,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:30,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-11 02:57:30,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:30,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-10-11 02:57:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:30,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-10-11 02:57:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:30,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-11 02:57:30,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 02:57:30,413 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-10-11 02:57:30,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 02:57:30,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869491989] [2024-10-11 02:57:30,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869491989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 02:57:30,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 02:57:30,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-10-11 02:57:30,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304423557] [2024-10-11 02:57:30,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 02:57:30,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-11 02:57:30,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 02:57:30,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-11 02:57:30,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2024-10-11 02:57:30,414 INFO L87 Difference]: Start difference. First operand 226254 states and 391524 transitions. Second operand has 16 states, 16 states have (on average 5.625) internal successors, (90), 9 states have internal predecessors, (90), 6 states have call successors, (17), 8 states have call predecessors, (17), 2 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14)