./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec1_product32.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec1_product32.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 23422b93e8eb894b39d133f7e6eb45372f0db0df72df3fa3f3890b8e90f2fd0e --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:39:54,425 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:39:54,481 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:39:54,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:39:54,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:39:54,521 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:39:54,522 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:39:54,522 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:39:54,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:39:54,525 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:39:54,526 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:39:54,526 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:39:54,527 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:39:54,527 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:39:54,527 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:39:54,528 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:39:54,531 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:39:54,532 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:39:54,532 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:39:54,532 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:39:54,532 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:39:54,533 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:39:54,533 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:39:54,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:39:54,534 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:39:54,534 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:39:54,534 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:39:54,534 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:39:54,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:39:54,535 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:39:54,535 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:39:54,535 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:39:54,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:39:54,536 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:39:54,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:39:54,536 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:39:54,538 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:39:54,538 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:39:54,539 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:39:54,539 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:39:54,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:39:54,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:39:54,539 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 23422b93e8eb894b39d133f7e6eb45372f0db0df72df3fa3f3890b8e90f2fd0e [2024-11-11 20:39:54,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:39:54,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:39:54,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:39:54,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:39:54,879 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:39:54,880 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec1_product32.cil.c [2024-11-11 20:39:56,318 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:39:56,618 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:39:56,620 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product32.cil.c [2024-11-11 20:39:56,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c177a457/669d32b398214e9a9071cd29da2b76b8/FLAG4482e4001 [2024-11-11 20:39:56,661 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4c177a457/669d32b398214e9a9071cd29da2b76b8 [2024-11-11 20:39:56,663 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:39:56,664 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:39:56,665 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:39:56,665 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:39:56,670 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:39:56,670 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:39:56" (1/1) ... [2024-11-11 20:39:56,671 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3901c35b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:56, skipping insertion in model container [2024-11-11 20:39:56,671 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:39:56" (1/1) ... [2024-11-11 20:39:56,727 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:39:57,255 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product32.cil.c[65472,65485] [2024-11-11 20:39:57,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:39:57,272 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:39:57,280 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2024-11-11 20:39:57,282 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [97] [2024-11-11 20:39:57,283 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [326] [2024-11-11 20:39:57,283 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [757] [2024-11-11 20:39:57,283 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [1156] [2024-11-11 20:39:57,283 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1185] [2024-11-11 20:39:57,283 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1202] [2024-11-11 20:39:57,283 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1568] [2024-11-11 20:39:57,284 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2640] [2024-11-11 20:39:57,284 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2776] [2024-11-11 20:39:57,284 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [3064] [2024-11-11 20:39:57,389 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product32.cil.c[65472,65485] [2024-11-11 20:39:57,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:39:57,423 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:39:57,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:57 WrapperNode [2024-11-11 20:39:57,424 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:39:57,425 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:39:57,426 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:39:57,426 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:39:57,432 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:57" (1/1) ... [2024-11-11 20:39:57,469 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:57" (1/1) ... [2024-11-11 20:39:57,534 INFO L138 Inliner]: procedures = 134, calls = 219, calls flagged for inlining = 61, calls inlined = 53, statements flattened = 985 [2024-11-11 20:39:57,535 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:39:57,536 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:39:57,536 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:39:57,536 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:39:57,549 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:57" (1/1) ... [2024-11-11 20:39:57,550 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:57" (1/1) ... [2024-11-11 20:39:57,557 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:57" (1/1) ... [2024-11-11 20:39:57,588 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2024-11-11 20:39:57,589 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:57" (1/1) ... [2024-11-11 20:39:57,589 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:57" (1/1) ... [2024-11-11 20:39:57,612 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:57" (1/1) ... [2024-11-11 20:39:57,628 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:57" (1/1) ... [2024-11-11 20:39:57,635 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:57" (1/1) ... [2024-11-11 20:39:57,640 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:57" (1/1) ... [2024-11-11 20:39:57,677 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:39:57,682 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:39:57,682 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:39:57,682 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:39:57,688 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:57" (1/1) ... [2024-11-11 20:39:57,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:39:57,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:39:57,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:39:57,752 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:39:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2024-11-11 20:39:57,843 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2024-11-11 20:39:57,843 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2024-11-11 20:39:57,843 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2024-11-11 20:39:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-11 20:39:57,844 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-11 20:39:57,844 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2024-11-11 20:39:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2024-11-11 20:39:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-11 20:39:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-11 20:39:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-11 20:39:57,845 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-11 20:39:57,845 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2024-11-11 20:39:57,847 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2024-11-11 20:39:57,847 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-11 20:39:57,847 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-11 20:39:57,848 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2024-11-11 20:39:57,849 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2024-11-11 20:39:57,851 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-11 20:39:57,851 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-11 20:39:57,851 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-11 20:39:57,852 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-11 20:39:57,852 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2024-11-11 20:39:57,852 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2024-11-11 20:39:57,852 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-11 20:39:57,852 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-11 20:39:57,852 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2024-11-11 20:39:57,852 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2024-11-11 20:39:57,852 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-11 20:39:57,853 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-11 20:39:57,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:39:57,853 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2024-11-11 20:39:57,853 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2024-11-11 20:39:57,853 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2024-11-11 20:39:57,853 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2024-11-11 20:39:57,853 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2024-11-11 20:39:57,853 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2024-11-11 20:39:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-11 20:39:57,854 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-11 20:39:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-11 20:39:57,854 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-11 20:39:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-11 20:39:57,854 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-11 20:39:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2024-11-11 20:39:57,854 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2024-11-11 20:39:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-11 20:39:57,854 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-11 20:39:57,854 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-11 20:39:57,854 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-11 20:39:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-11 20:39:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-11 20:39:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2024-11-11 20:39:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2024-11-11 20:39:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:39:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:39:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:39:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:39:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-11 20:39:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-11 20:39:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2024-11-11 20:39:57,855 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2024-11-11 20:39:57,855 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:39:57,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:39:58,086 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:39:58,088 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:39:59,061 INFO L? ?]: Removed 536 outVars from TransFormulas that were not future-live. [2024-11-11 20:39:59,061 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:39:59,093 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:39:59,094 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:39:59,094 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:39:59 BoogieIcfgContainer [2024-11-11 20:39:59,094 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:39:59,097 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:39:59,097 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:39:59,100 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:39:59,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:39:56" (1/3) ... [2024-11-11 20:39:59,101 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8f9b2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:39:59, skipping insertion in model container [2024-11-11 20:39:59,101 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:39:57" (2/3) ... [2024-11-11 20:39:59,102 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e8f9b2d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:39:59, skipping insertion in model container [2024-11-11 20:39:59,102 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:39:59" (3/3) ... [2024-11-11 20:39:59,103 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec1_product32.cil.c [2024-11-11 20:39:59,120 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:39:59,120 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:39:59,211 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:39:59,220 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;@6f81806c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:39:59,221 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:39:59,229 INFO L276 IsEmpty]: Start isEmpty. Operand has 425 states, 330 states have (on average 1.5515151515151515) internal successors, (512), 335 states have internal predecessors, (512), 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-11-11 20:39:59,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-11 20:39:59,257 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:59,259 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:39:59,260 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:59,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:59,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1920042768, now seen corresponding path program 1 times [2024-11-11 20:39:59,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:59,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686980870] [2024-11-11 20:39:59,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:59,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:00,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:40:00,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:40:00,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:40:00,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:40:00,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-11-11 20:40:00,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:40:00,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:40:00,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:40:00,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:40:00,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:40:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:40:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 20:40:00,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:00,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686980870] [2024-11-11 20:40:00,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686980870] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:40:00,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601829506] [2024-11-11 20:40:00,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:00,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:00,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:40:00,183 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:40:00,185 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:40:00,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:00,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 20:40:00,562 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:40:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:40:00,580 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:40:00,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601829506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:00,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:40:00,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [9] total 9 [2024-11-11 20:40:00,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870064427] [2024-11-11 20:40:00,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:00,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:40:00,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:00,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:40:00,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:40:00,618 INFO L87 Difference]: Start difference. First operand has 425 states, 330 states have (on average 1.5515151515151515) internal successors, (512), 335 states have internal predecessors, (512), 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 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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-11-11 20:40:00,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:00,688 INFO L93 Difference]: Finished difference Result 657 states and 974 transitions. [2024-11-11 20:40:00,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:40:00,691 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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 110 [2024-11-11 20:40:00,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:00,711 INFO L225 Difference]: With dead ends: 657 [2024-11-11 20:40:00,711 INFO L226 Difference]: Without dead ends: 418 [2024-11-11 20:40:00,718 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:40:00,721 INFO L435 NwaCegarLoop]: 638 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:00,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 638 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:40:00,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-11-11 20:40:00,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2024-11-11 20:40:00,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 324 states have (on average 1.5462962962962963) internal successors, (501), 328 states have internal predecessors, (501), 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-11-11 20:40:00,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 630 transitions. [2024-11-11 20:40:00,806 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 630 transitions. Word has length 110 [2024-11-11 20:40:00,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:00,807 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 630 transitions. [2024-11-11 20:40:00,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 32.0) internal successors, (64), 2 states have internal predecessors, (64), 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-11-11 20:40:00,808 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 630 transitions. [2024-11-11 20:40:00,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 20:40:00,816 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:00,816 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:00,840 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-11 20:40:01,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-11 20:40:01,018 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:01,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:01,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1988702151, now seen corresponding path program 1 times [2024-11-11 20:40:01,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:01,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831218522] [2024-11-11 20:40:01,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:01,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:01,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:01,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:01,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:01,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:01,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:01,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:01,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:40:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:01,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:40:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:01,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:40:01,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:01,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:40:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:01,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-11 20:40:01,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:01,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:40:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:01,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:40:01,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:01,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:40:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:01,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:40:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:01,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:40:01,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:01,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:40:01,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:01,388 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 20:40:01,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:01,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831218522] [2024-11-11 20:40:01,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831218522] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:40:01,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [695732320] [2024-11-11 20:40:01,389 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:01,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:01,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:40:01,392 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:40:01,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 20:40:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:01,746 INFO L256 TraceCheckSpWp]: Trace formula consists of 1104 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:40:01,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:40:01,783 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:40:01,783 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:40:01,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [695732320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:01,784 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:40:01,784 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:40:01,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615510706] [2024-11-11 20:40:01,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:01,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:40:01,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:01,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:40:01,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:40:01,790 INFO L87 Difference]: Start difference. First operand 418 states and 630 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-11-11 20:40:01,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:01,861 INFO L93 Difference]: Finished difference Result 647 states and 952 transitions. [2024-11-11 20:40:01,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:40:01,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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 111 [2024-11-11 20:40:01,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:01,867 INFO L225 Difference]: With dead ends: 647 [2024-11-11 20:40:01,870 INFO L226 Difference]: Without dead ends: 421 [2024-11-11 20:40:01,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 134 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:40:01,873 INFO L435 NwaCegarLoop]: 628 mSDtfsCounter, 1 mSDsluCounter, 626 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1254 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:01,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1254 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:40:01,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-11-11 20:40:01,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 420. [2024-11-11 20:40:01,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 326 states have (on average 1.5429447852760736) internal successors, (503), 330 states have internal predecessors, (503), 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-11-11 20:40:01,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 632 transitions. [2024-11-11 20:40:01,926 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 632 transitions. Word has length 111 [2024-11-11 20:40:01,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:01,928 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 632 transitions. [2024-11-11 20:40:01,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 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-11-11 20:40:01,929 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 632 transitions. [2024-11-11 20:40:01,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-11 20:40:01,933 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:01,934 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:01,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 20:40:02,134 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-11 20:40:02,135 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:02,135 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:02,136 INFO L85 PathProgramCache]: Analyzing trace with hash 1245902075, now seen corresponding path program 1 times [2024-11-11 20:40:02,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:02,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312554983] [2024-11-11 20:40:02,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:02,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:02,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:02,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:02,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:40:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:40:02,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:40:02,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:40:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:40:02,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:40:02,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:40:02,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:40:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:40:02,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:40:02,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:40:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,443 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:40:02,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:02,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312554983] [2024-11-11 20:40:02,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312554983] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:40:02,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1847186785] [2024-11-11 20:40:02,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:02,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:02,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:40:02,448 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:40:02,450 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 20:40:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:02,745 INFO L256 TraceCheckSpWp]: Trace formula consists of 1129 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:40:02,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:40:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:40:02,786 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:40:02,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1847186785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:02,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:40:02,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2024-11-11 20:40:02,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960816871] [2024-11-11 20:40:02,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:02,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:40:02,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:02,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:40:02,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:40:02,790 INFO L87 Difference]: Start difference. First operand 420 states and 632 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-11-11 20:40:02,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:02,853 INFO L93 Difference]: Finished difference Result 888 states and 1356 transitions. [2024-11-11 20:40:02,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:40:02,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 120 [2024-11-11 20:40:02,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:02,858 INFO L225 Difference]: With dead ends: 888 [2024-11-11 20:40:02,860 INFO L226 Difference]: Without dead ends: 495 [2024-11-11 20:40:02,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:40:02,864 INFO L435 NwaCegarLoop]: 644 mSDtfsCounter, 134 mSDsluCounter, 584 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1228 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:02,864 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1228 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:40:02,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2024-11-11 20:40:02,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 487. [2024-11-11 20:40:02,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 379 states have (on average 1.562005277044855) internal successors, (592), 383 states have internal predecessors, (592), 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-11-11 20:40:02,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 749 transitions. [2024-11-11 20:40:02,889 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 749 transitions. Word has length 120 [2024-11-11 20:40:02,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:02,890 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 749 transitions. [2024-11-11 20:40:02,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-11-11 20:40:02,890 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 749 transitions. [2024-11-11 20:40:02,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-11 20:40:02,893 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:02,894 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:02,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-11 20:40:03,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:03,099 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:03,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:03,099 INFO L85 PathProgramCache]: Analyzing trace with hash -625115686, now seen corresponding path program 1 times [2024-11-11 20:40:03,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:03,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617875913] [2024-11-11 20:40:03,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:03,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:03,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:03,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:03,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:03,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:03,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:03,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:40:03,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:03,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:40:03,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:03,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:40:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:03,302 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:40:03,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:03,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:40:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:03,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:40:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:03,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:40:03,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:03,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:40:03,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:03,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:40:03,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:03,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:40:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:03,332 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:40:03,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:03,334 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:40:03,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:03,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617875913] [2024-11-11 20:40:03,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617875913] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:40:03,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [598917696] [2024-11-11 20:40:03,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:03,336 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:03,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:40:03,338 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:40:03,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 20:40:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:03,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 1134 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:40:03,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:40:03,717 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:40:03,718 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:40:03,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [598917696] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:03,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:40:03,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [9] total 12 [2024-11-11 20:40:03,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663866968] [2024-11-11 20:40:03,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:03,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:40:03,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:03,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:40:03,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:40:03,720 INFO L87 Difference]: Start difference. First operand 487 states and 749 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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-11-11 20:40:03,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:03,823 INFO L93 Difference]: Finished difference Result 965 states and 1488 transitions. [2024-11-11 20:40:03,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:40:03,824 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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 121 [2024-11-11 20:40:03,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:03,827 INFO L225 Difference]: With dead ends: 965 [2024-11-11 20:40:03,827 INFO L226 Difference]: Without dead ends: 489 [2024-11-11 20:40:03,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:40:03,830 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 2 mSDsluCounter, 1855 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2477 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:03,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2477 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:40:03,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-11 20:40:03,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2024-11-11 20:40:03,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 380 states have (on average 1.5605263157894738) internal successors, (593), 385 states have internal predecessors, (593), 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-11-11 20:40:03,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 752 transitions. [2024-11-11 20:40:03,861 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 752 transitions. Word has length 121 [2024-11-11 20:40:03,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:03,861 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 752 transitions. [2024-11-11 20:40:03,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 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-11-11 20:40:03,862 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 752 transitions. [2024-11-11 20:40:03,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-11 20:40:03,866 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:03,866 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:03,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 20:40:04,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:04,067 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:04,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:04,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1495995839, now seen corresponding path program 1 times [2024-11-11 20:40:04,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:04,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542848609] [2024-11-11 20:40:04,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:04,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:04,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:04,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:04,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:04,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:04,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:04,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:04,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:04,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:04,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:40:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:04,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:40:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:04,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:40:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:04,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:40:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:04,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:40:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:04,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:40:04,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:04,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:40:04,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:04,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:40:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:04,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:40:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:04,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:40:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:04,343 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:40:04,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:04,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542848609] [2024-11-11 20:40:04,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542848609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:40:04,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228739205] [2024-11-11 20:40:04,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:04,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:04,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:40:04,346 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:40:04,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 20:40:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:04,654 INFO L256 TraceCheckSpWp]: Trace formula consists of 1135 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 20:40:04,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:40:04,726 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:40:04,726 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:40:04,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228739205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:04,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:40:04,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [12] total 15 [2024-11-11 20:40:04,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47261511] [2024-11-11 20:40:04,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:04,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:40:04,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:04,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:40:04,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:40:04,728 INFO L87 Difference]: Start difference. First operand 489 states and 752 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-11-11 20:40:04,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:04,797 INFO L93 Difference]: Finished difference Result 967 states and 1493 transitions. [2024-11-11 20:40:04,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:40:04,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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 122 [2024-11-11 20:40:04,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:04,801 INFO L225 Difference]: With dead ends: 967 [2024-11-11 20:40:04,802 INFO L226 Difference]: Without dead ends: 491 [2024-11-11 20:40:04,804 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=180, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:40:04,805 INFO L435 NwaCegarLoop]: 620 mSDtfsCounter, 2 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2463 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:04,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2463 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:40:04,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2024-11-11 20:40:04,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 491. [2024-11-11 20:40:04,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 381 states have (on average 1.5590551181102361) internal successors, (594), 387 states have internal predecessors, (594), 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-11-11 20:40:04,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 758 transitions. [2024-11-11 20:40:04,851 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 758 transitions. Word has length 122 [2024-11-11 20:40:04,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:04,852 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 758 transitions. [2024-11-11 20:40:04,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 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-11-11 20:40:04,852 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 758 transitions. [2024-11-11 20:40:04,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-11 20:40:04,854 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:04,855 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:04,873 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-11 20:40:05,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:05,057 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:05,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:05,058 INFO L85 PathProgramCache]: Analyzing trace with hash -20354496, now seen corresponding path program 1 times [2024-11-11 20:40:05,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:05,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404359245] [2024-11-11 20:40:05,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:05,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:05,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:05,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:05,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:05,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:05,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:05,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:05,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:05,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:05,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:05,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:05,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:05,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:40:05,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:05,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:40:05,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:05,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 20:40:05,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:05,258 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:40:05,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:05,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:40:05,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:05,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:40:05,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:05,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:40:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:05,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:40:05,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:05,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:40:05,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:05,268 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:40:05,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:05,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404359245] [2024-11-11 20:40:05,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404359245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:05,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:05,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:40:05,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723651793] [2024-11-11 20:40:05,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:05,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:40:05,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:05,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:40:05,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:40:05,270 INFO L87 Difference]: Start difference. First operand 491 states and 758 transitions. Second operand has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 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-11-11 20:40:07,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:07,626 INFO L93 Difference]: Finished difference Result 1093 states and 1709 transitions. [2024-11-11 20:40:07,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:40:07,627 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 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 123 [2024-11-11 20:40:07,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:07,631 INFO L225 Difference]: With dead ends: 1093 [2024-11-11 20:40:07,633 INFO L226 Difference]: Without dead ends: 625 [2024-11-11 20:40:07,635 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:40:07,636 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 1424 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 2730 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1425 SdHoareTripleChecker+Valid, 1339 SdHoareTripleChecker+Invalid, 3199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 2730 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:07,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1425 Valid, 1339 Invalid, 3199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 2730 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-11 20:40:07,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2024-11-11 20:40:07,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 491. [2024-11-11 20:40:07,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 381 states have (on average 1.5590551181102361) internal successors, (594), 387 states have internal predecessors, (594), 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-11-11 20:40:07,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 757 transitions. [2024-11-11 20:40:07,694 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 757 transitions. Word has length 123 [2024-11-11 20:40:07,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:07,695 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 757 transitions. [2024-11-11 20:40:07,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.125) internal successors, (81), 5 states have internal predecessors, (81), 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-11-11 20:40:07,695 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 757 transitions. [2024-11-11 20:40:07,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-11 20:40:07,697 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:07,697 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:07,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:40:07,698 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:07,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:07,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2021439229, now seen corresponding path program 2 times [2024-11-11 20:40:07,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:07,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421241879] [2024-11-11 20:40:07,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:07,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:07,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:07,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:40:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:40:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:40:07,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:40:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:40:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:40:07,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:40:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:40:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:40:07,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:07,912 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:40:07,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:07,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421241879] [2024-11-11 20:40:07,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421241879] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:07,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:07,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-11 20:40:07,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181496184] [2024-11-11 20:40:07,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:07,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-11 20:40:07,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:07,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-11 20:40:07,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:40:07,914 INFO L87 Difference]: Start difference. First operand 491 states and 757 transitions. Second operand has 9 states, 8 states have (on average 10.25) internal successors, (82), 5 states have internal predecessors, (82), 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-11-11 20:40:10,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:10,117 INFO L93 Difference]: Finished difference Result 1095 states and 1712 transitions. [2024-11-11 20:40:10,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-11 20:40:10,118 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 10.25) internal successors, (82), 5 states have internal predecessors, (82), 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 124 [2024-11-11 20:40:10,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:10,124 INFO L225 Difference]: With dead ends: 1095 [2024-11-11 20:40:10,124 INFO L226 Difference]: Without dead ends: 627 [2024-11-11 20:40:10,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-11-11 20:40:10,128 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 1413 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 2814 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1414 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 3248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 2814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:10,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1414 Valid, 1338 Invalid, 3248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 2814 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-11 20:40:10,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-11 20:40:10,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 493. [2024-11-11 20:40:10,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 382 states have (on average 1.557591623036649) internal successors, (595), 389 states have internal predecessors, (595), 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-11-11 20:40:10,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 760 transitions. [2024-11-11 20:40:10,172 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 760 transitions. Word has length 124 [2024-11-11 20:40:10,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:10,172 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 760 transitions. [2024-11-11 20:40:10,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 10.25) internal successors, (82), 5 states have internal predecessors, (82), 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-11-11 20:40:10,173 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 760 transitions. [2024-11-11 20:40:10,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-11 20:40:10,175 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:10,175 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:10,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:40:10,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:10,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:10,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1557390427, now seen corresponding path program 1 times [2024-11-11 20:40:10,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:10,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276858189] [2024-11-11 20:40:10,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:10,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:10,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:10,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:10,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:10,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:10,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:10,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-11 20:40:10,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:40:10,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:40:10,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:40:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:40:10,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:40:10,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:40:10,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:40:10,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:10,465 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:40:10,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:10,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276858189] [2024-11-11 20:40:10,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276858189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:10,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:10,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:40:10,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691779176] [2024-11-11 20:40:10,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:10,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:40:10,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:10,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:40:10,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:40:10,468 INFO L87 Difference]: Start difference. First operand 493 states and 760 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 8 states have internal predecessors, (86), 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-11-11 20:40:13,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:13,240 INFO L93 Difference]: Finished difference Result 1093 states and 1707 transitions. [2024-11-11 20:40:13,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:40:13,241 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 8 states have internal predecessors, (86), 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 125 [2024-11-11 20:40:13,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:13,246 INFO L225 Difference]: With dead ends: 1093 [2024-11-11 20:40:13,246 INFO L226 Difference]: Without dead ends: 627 [2024-11-11 20:40:13,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-11 20:40:13,250 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 1422 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 4612 mSolverCounterSat, 471 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 1856 SdHoareTripleChecker+Invalid, 5083 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 471 IncrementalHoareTripleChecker+Valid, 4612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:13,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1423 Valid, 1856 Invalid, 5083 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [471 Valid, 4612 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 20:40:13,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2024-11-11 20:40:13,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 493. [2024-11-11 20:40:13,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 493 states, 382 states have (on average 1.557591623036649) internal successors, (595), 389 states have internal predecessors, (595), 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-11-11 20:40:13,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 759 transitions. [2024-11-11 20:40:13,309 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 759 transitions. Word has length 125 [2024-11-11 20:40:13,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:13,310 INFO L471 AbstractCegarLoop]: Abstraction has 493 states and 759 transitions. [2024-11-11 20:40:13,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 8 states have internal predecessors, (86), 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-11-11 20:40:13,310 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 759 transitions. [2024-11-11 20:40:13,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-11 20:40:13,313 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:13,313 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:13,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:40:13,314 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:13,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:13,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1919225920, now seen corresponding path program 2 times [2024-11-11 20:40:13,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:13,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836219502] [2024-11-11 20:40:13,315 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:13,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:13,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:13,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:13,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:13,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:13,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:13,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-11 20:40:13,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:40:13,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:40:13,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:40:13,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:40:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:40:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:40:13,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 20:40:13,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:13,560 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:40:13,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:13,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836219502] [2024-11-11 20:40:13,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836219502] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:13,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:13,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-11 20:40:13,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551277487] [2024-11-11 20:40:13,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:13,560 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-11 20:40:13,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:13,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-11 20:40:13,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-11-11 20:40:13,561 INFO L87 Difference]: Start difference. First operand 493 states and 759 transitions. Second operand has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 8 states have internal predecessors, (87), 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-11-11 20:40:16,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:16,080 INFO L93 Difference]: Finished difference Result 1095 states and 1713 transitions. [2024-11-11 20:40:16,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:40:16,081 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 8 states have internal predecessors, (87), 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 126 [2024-11-11 20:40:16,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:16,087 INFO L225 Difference]: With dead ends: 1095 [2024-11-11 20:40:16,087 INFO L226 Difference]: Without dead ends: 629 [2024-11-11 20:40:16,089 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2024-11-11 20:40:16,090 INFO L435 NwaCegarLoop]: 209 mSDtfsCounter, 1415 mSDsluCounter, 1646 mSDsCounter, 0 mSdLazyCounter, 4690 mSolverCounterSat, 452 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1416 SdHoareTripleChecker+Valid, 1855 SdHoareTripleChecker+Invalid, 5142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 452 IncrementalHoareTripleChecker+Valid, 4690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:16,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1416 Valid, 1855 Invalid, 5142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [452 Valid, 4690 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-11 20:40:16,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2024-11-11 20:40:16,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 495. [2024-11-11 20:40:16,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 383 states have (on average 1.556135770234987) internal successors, (596), 391 states have internal predecessors, (596), 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-11-11 20:40:16,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 765 transitions. [2024-11-11 20:40:16,128 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 765 transitions. Word has length 126 [2024-11-11 20:40:16,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:16,128 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 765 transitions. [2024-11-11 20:40:16,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 8 states have internal predecessors, (87), 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-11-11 20:40:16,129 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 765 transitions. [2024-11-11 20:40:16,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-11 20:40:16,131 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:16,131 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:16,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:40:16,131 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:16,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:16,132 INFO L85 PathProgramCache]: Analyzing trace with hash 913432522, now seen corresponding path program 1 times [2024-11-11 20:40:16,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:16,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556968033] [2024-11-11 20:40:16,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:16,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:16,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:16,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:16,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:16,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:16,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:16,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-11 20:40:16,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:40:16,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:40:16,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:40:16,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:40:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:40:16,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:40:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 20:40:16,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,420 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2024-11-11 20:40:16,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:16,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556968033] [2024-11-11 20:40:16,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556968033] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:40:16,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234866073] [2024-11-11 20:40:16,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:16,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:16,421 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:40:16,423 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:40:16,425 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 20:40:16,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:16,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 1140 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:40:16,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:40:16,769 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:16,770 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:40:16,867 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:16,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234866073] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:40:16,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:40:16,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 4, 4] total 15 [2024-11-11 20:40:16,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307234596] [2024-11-11 20:40:16,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:40:16,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-11 20:40:16,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:16,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-11 20:40:16,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2024-11-11 20:40:16,869 INFO L87 Difference]: Start difference. First operand 495 states and 765 transitions. Second operand has 15 states, 14 states have (on average 10.285714285714286) internal successors, (144), 11 states have internal predecessors, (144), 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-11-11 20:40:19,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:19,675 INFO L93 Difference]: Finished difference Result 1535 states and 2510 transitions. [2024-11-11 20:40:19,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-11 20:40:19,676 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 10.285714285714286) internal successors, (144), 11 states have internal predecessors, (144), 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 127 [2024-11-11 20:40:19,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:19,682 INFO L225 Difference]: With dead ends: 1535 [2024-11-11 20:40:19,682 INFO L226 Difference]: Without dead ends: 1071 [2024-11-11 20:40:19,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 277 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-11-11 20:40:19,685 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 2944 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 5022 mSolverCounterSat, 916 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2965 SdHoareTripleChecker+Valid, 2036 SdHoareTripleChecker+Invalid, 5938 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 916 IncrementalHoareTripleChecker+Valid, 5022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:19,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2965 Valid, 2036 Invalid, 5938 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [916 Valid, 5022 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-11 20:40:19,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1071 states. [2024-11-11 20:40:19,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1071 to 913. [2024-11-11 20:40:19,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 913 states, 722 states have (on average 1.6094182825484764) internal successors, (1162), 730 states have internal predecessors, (1162), 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-11-11 20:40:19,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 913 states to 913 states and 1499 transitions. [2024-11-11 20:40:19,763 INFO L78 Accepts]: Start accepts. Automaton has 913 states and 1499 transitions. Word has length 127 [2024-11-11 20:40:19,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:19,763 INFO L471 AbstractCegarLoop]: Abstraction has 913 states and 1499 transitions. [2024-11-11 20:40:19,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 10.285714285714286) internal successors, (144), 11 states have internal predecessors, (144), 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-11-11 20:40:19,763 INFO L276 IsEmpty]: Start isEmpty. Operand 913 states and 1499 transitions. [2024-11-11 20:40:19,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-11-11 20:40:19,767 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:19,767 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:19,787 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 20:40:19,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:40:19,968 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:19,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:19,969 INFO L85 PathProgramCache]: Analyzing trace with hash 1163883698, now seen corresponding path program 1 times [2024-11-11 20:40:19,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:19,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451722454] [2024-11-11 20:40:19,969 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:19,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:20,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:20,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:20,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:20,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:20,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:20,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:20,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:20,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:20,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:20,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:20,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:20,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:20,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:40:20,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:20,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:40:20,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:20,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:40:20,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:20,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:40:20,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:20,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:40:20,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:20,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:40:20,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:20,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-11 20:40:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:20,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:40:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:20,079 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:20,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:20,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451722454] [2024-11-11 20:40:20,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451722454] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:20,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:20,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:40:20,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984283628] [2024-11-11 20:40:20,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:20,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:40:20,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:20,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:40:20,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:40:20,081 INFO L87 Difference]: Start difference. First operand 913 states and 1499 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-11-11 20:40:21,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:21,487 INFO L93 Difference]: Finished difference Result 2280 states and 3839 transitions. [2024-11-11 20:40:21,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:40:21,488 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-11-11 20:40:21,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:21,497 INFO L225 Difference]: With dead ends: 2280 [2024-11-11 20:40:21,497 INFO L226 Difference]: Without dead ends: 1445 [2024-11-11 20:40:21,500 INFO L434 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-11-11 20:40:21,501 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 1541 mSDsluCounter, 782 mSDsCounter, 0 mSdLazyCounter, 1581 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 2098 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 1581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:21,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 1008 Invalid, 2098 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 1581 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:40:21,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2024-11-11 20:40:21,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1303. [2024-11-11 20:40:21,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1303 states, 1033 states have (on average 1.628267182962246) internal successors, (1682), 1041 states have internal predecessors, (1682), 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-11-11 20:40:21,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1303 states to 1303 states and 2187 transitions. [2024-11-11 20:40:21,569 INFO L78 Accepts]: Start accepts. Automaton has 1303 states and 2187 transitions. Word has length 130 [2024-11-11 20:40:21,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:21,569 INFO L471 AbstractCegarLoop]: Abstraction has 1303 states and 2187 transitions. [2024-11-11 20:40:21,570 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-11-11 20:40:21,570 INFO L276 IsEmpty]: Start isEmpty. Operand 1303 states and 2187 transitions. [2024-11-11 20:40:21,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-11 20:40:21,576 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:21,576 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:21,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:40:21,576 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:21,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:21,577 INFO L85 PathProgramCache]: Analyzing trace with hash 2014115342, now seen corresponding path program 1 times [2024-11-11 20:40:21,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:21,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975202156] [2024-11-11 20:40:21,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:21,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:21,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:21,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:21,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:21,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:21,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:21,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:21,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:21,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:21,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:21,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:21,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:21,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:40:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:21,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:40:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:21,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:40:21,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:21,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:40:21,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:21,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:40:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:21,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:40:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:21,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-11 20:40:21,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:21,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 20:40:21,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:21,716 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:21,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:21,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975202156] [2024-11-11 20:40:21,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975202156] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:21,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:21,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:40:21,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810427786] [2024-11-11 20:40:21,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:21,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:40:21,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:21,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:40:21,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:40:21,718 INFO L87 Difference]: Start difference. First operand 1303 states and 2187 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-11-11 20:40:23,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:23,205 INFO L93 Difference]: Finished difference Result 3254 states and 5548 transitions. [2024-11-11 20:40:23,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:40:23,205 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-11-11 20:40:23,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:23,216 INFO L225 Difference]: With dead ends: 3254 [2024-11-11 20:40:23,216 INFO L226 Difference]: Without dead ends: 2082 [2024-11-11 20:40:23,221 INFO L434 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-11-11 20:40:23,222 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 1544 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1527 mSolverCounterSat, 542 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1563 SdHoareTripleChecker+Valid, 982 SdHoareTripleChecker+Invalid, 2069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 542 IncrementalHoareTripleChecker+Valid, 1527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:23,222 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1563 Valid, 982 Invalid, 2069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [542 Valid, 1527 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 20:40:23,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2082 states. [2024-11-11 20:40:23,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2082 to 1940. [2024-11-11 20:40:23,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1940 states, 1551 states have (on average 1.6376531270148291) internal successors, (2540), 1559 states have internal predecessors, (2540), 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-11-11 20:40:23,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1940 states to 1940 states and 3283 transitions. [2024-11-11 20:40:23,319 INFO L78 Accepts]: Start accepts. Automaton has 1940 states and 3283 transitions. Word has length 131 [2024-11-11 20:40:23,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:23,319 INFO L471 AbstractCegarLoop]: Abstraction has 1940 states and 3283 transitions. [2024-11-11 20:40:23,320 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-11-11 20:40:23,320 INFO L276 IsEmpty]: Start isEmpty. Operand 1940 states and 3283 transitions. [2024-11-11 20:40:23,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-11 20:40:23,329 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:23,329 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:23,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:40:23,330 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:23,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:23,330 INFO L85 PathProgramCache]: Analyzing trace with hash -448973916, now seen corresponding path program 1 times [2024-11-11 20:40:23,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:23,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481608558] [2024-11-11 20:40:23,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:23,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:23,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:23,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:23,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:23,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:23,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:23,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:23,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:23,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:23,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:40:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:23,440 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:40:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:23,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:40:23,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:23,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:40:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:23,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:40:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:23,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:40:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:23,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-11 20:40:23,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:23,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 20:40:23,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:23,452 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:23,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:23,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481608558] [2024-11-11 20:40:23,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [481608558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:23,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:23,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:40:23,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483108236] [2024-11-11 20:40:23,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:23,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:40:23,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:23,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:40:23,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:40:23,454 INFO L87 Difference]: Start difference. First operand 1940 states and 3283 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-11-11 20:40:25,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:25,027 INFO L93 Difference]: Finished difference Result 4734 states and 8159 transitions. [2024-11-11 20:40:25,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:40:25,028 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-11-11 20:40:25,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:25,044 INFO L225 Difference]: With dead ends: 4734 [2024-11-11 20:40:25,044 INFO L226 Difference]: Without dead ends: 3060 [2024-11-11 20:40:25,053 INFO L434 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-11-11 20:40:25,053 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 1537 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 1546 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 2061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 1546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:25,054 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 976 Invalid, 2061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 1546 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 20:40:25,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3060 states. [2024-11-11 20:40:25,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3060 to 2918. [2024-11-11 20:40:25,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2918 states, 2367 states have (on average 1.6451204055766793) internal successors, (3894), 2375 states have internal predecessors, (3894), 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-11-11 20:40:25,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2918 states to 2918 states and 4977 transitions. [2024-11-11 20:40:25,235 INFO L78 Accepts]: Start accepts. Automaton has 2918 states and 4977 transitions. Word has length 132 [2024-11-11 20:40:25,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:25,235 INFO L471 AbstractCegarLoop]: Abstraction has 2918 states and 4977 transitions. [2024-11-11 20:40:25,235 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-11-11 20:40:25,235 INFO L276 IsEmpty]: Start isEmpty. Operand 2918 states and 4977 transitions. [2024-11-11 20:40:25,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-11 20:40:25,249 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:25,249 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:25,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:40:25,249 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:25,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:25,250 INFO L85 PathProgramCache]: Analyzing trace with hash 260299725, now seen corresponding path program 1 times [2024-11-11 20:40:25,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:25,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726215382] [2024-11-11 20:40:25,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:25,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:25,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:25,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:25,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:25,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:25,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:25,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:25,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:40:25,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:40:25,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:40:25,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:40:25,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:40:25,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:40:25,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2024-11-11 20:40:25,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 20:40:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:25,374 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:25,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:25,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726215382] [2024-11-11 20:40:25,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726215382] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:25,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:25,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:40:25,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653525498] [2024-11-11 20:40:25,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:25,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:40:25,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:25,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:40:25,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:40:25,377 INFO L87 Difference]: Start difference. First operand 2918 states and 4977 transitions. Second operand has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 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-11-11 20:40:26,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:26,939 INFO L93 Difference]: Finished difference Result 7073 states and 12294 transitions. [2024-11-11 20:40:26,939 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:40:26,940 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 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 133 [2024-11-11 20:40:26,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:26,964 INFO L225 Difference]: With dead ends: 7073 [2024-11-11 20:40:26,964 INFO L226 Difference]: Without dead ends: 4640 [2024-11-11 20:40:26,971 INFO L434 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-11-11 20:40:26,972 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 1537 mSDsluCounter, 765 mSDsCounter, 0 mSdLazyCounter, 1548 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1555 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 2061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 1548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:26,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1555 Valid, 976 Invalid, 2061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 1548 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 20:40:26,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4640 states. [2024-11-11 20:40:27,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4640 to 4498. [2024-11-11 20:40:27,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4498 states, 3702 states have (on average 1.650459211237169) internal successors, (6110), 3710 states have internal predecessors, (6110), 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-11-11 20:40:27,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4498 states to 4498 states and 7709 transitions. [2024-11-11 20:40:27,181 INFO L78 Accepts]: Start accepts. Automaton has 4498 states and 7709 transitions. Word has length 133 [2024-11-11 20:40:27,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:27,182 INFO L471 AbstractCegarLoop]: Abstraction has 4498 states and 7709 transitions. [2024-11-11 20:40:27,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.714285714285714) internal successors, (89), 3 states have internal predecessors, (89), 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-11-11 20:40:27,183 INFO L276 IsEmpty]: Start isEmpty. Operand 4498 states and 7709 transitions. [2024-11-11 20:40:27,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-11 20:40:27,206 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:27,206 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:27,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:40:27,206 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:27,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:27,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1703651880, now seen corresponding path program 1 times [2024-11-11 20:40:27,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:27,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513292642] [2024-11-11 20:40:27,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:27,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:27,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:27,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:27,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:27,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:27,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:27,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:27,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:27,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:27,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:27,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:27,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:27,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:40:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:27,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:40:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:27,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:40:27,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:27,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:40:27,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:27,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:40:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:27,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:40:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:27,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2024-11-11 20:40:27,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:27,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-11 20:40:27,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:27,332 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:27,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:27,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513292642] [2024-11-11 20:40:27,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513292642] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:27,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:27,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:40:27,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1747085166] [2024-11-11 20:40:27,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:27,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:40:27,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:27,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:40:27,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:40:27,334 INFO L87 Difference]: Start difference. First operand 4498 states and 7709 transitions. Second operand has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 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-11-11 20:40:28,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:28,871 INFO L93 Difference]: Finished difference Result 11244 states and 19623 transitions. [2024-11-11 20:40:28,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:40:28,871 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 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 134 [2024-11-11 20:40:28,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:28,918 INFO L225 Difference]: With dead ends: 11244 [2024-11-11 20:40:28,918 INFO L226 Difference]: Without dead ends: 7483 [2024-11-11 20:40:28,941 INFO L434 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-11-11 20:40:28,942 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 1535 mSDsluCounter, 787 mSDsCounter, 0 mSdLazyCounter, 1576 mSolverCounterSat, 528 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1554 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 2104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 528 IncrementalHoareTripleChecker+Valid, 1576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:28,942 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1554 Valid, 1007 Invalid, 2104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [528 Valid, 1576 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-11 20:40:28,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7483 states. [2024-11-11 20:40:29,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7483 to 7341. [2024-11-11 20:40:29,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7341 states, 6052 states have (on average 1.647224058162591) internal successors, (9969), 6060 states have internal predecessors, (9969), 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-11-11 20:40:29,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7341 states to 7341 states and 12598 transitions. [2024-11-11 20:40:29,348 INFO L78 Accepts]: Start accepts. Automaton has 7341 states and 12598 transitions. Word has length 134 [2024-11-11 20:40:29,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:29,349 INFO L471 AbstractCegarLoop]: Abstraction has 7341 states and 12598 transitions. [2024-11-11 20:40:29,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 12.857142857142858) internal successors, (90), 3 states have internal predecessors, (90), 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-11-11 20:40:29,350 INFO L276 IsEmpty]: Start isEmpty. Operand 7341 states and 12598 transitions. [2024-11-11 20:40:29,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-11 20:40:29,371 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:29,371 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:29,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 20:40:29,372 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:29,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:29,372 INFO L85 PathProgramCache]: Analyzing trace with hash 756971849, now seen corresponding path program 1 times [2024-11-11 20:40:29,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:29,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [316536584] [2024-11-11 20:40:29,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:29,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:29,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:29,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:29,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:29,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:29,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:29,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:29,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:29,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:29,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:29,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:40:29,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:29,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:40:29,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:29,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:40:29,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:29,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:40:29,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:29,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:40:29,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:29,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:40:29,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:29,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-11 20:40:29,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:29,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-11 20:40:29,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:29,494 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:29,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:29,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [316536584] [2024-11-11 20:40:29,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [316536584] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:29,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:29,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:40:29,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003940406] [2024-11-11 20:40:29,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:29,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:40:29,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:29,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:40:29,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:40:29,497 INFO L87 Difference]: Start difference. First operand 7341 states and 12598 transitions. Second operand has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 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-11-11 20:40:31,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:31,000 INFO L93 Difference]: Finished difference Result 18664 states and 32587 transitions. [2024-11-11 20:40:31,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:40:31,001 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 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 135 [2024-11-11 20:40:31,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:31,047 INFO L225 Difference]: With dead ends: 18664 [2024-11-11 20:40:31,047 INFO L226 Difference]: Without dead ends: 12462 [2024-11-11 20:40:31,072 INFO L434 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-11-11 20:40:31,073 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 1540 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1538 mSolverCounterSat, 520 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1559 SdHoareTripleChecker+Valid, 981 SdHoareTripleChecker+Invalid, 2058 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 520 IncrementalHoareTripleChecker+Valid, 1538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:31,073 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1559 Valid, 981 Invalid, 2058 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [520 Valid, 1538 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:40:31,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12462 states. [2024-11-11 20:40:31,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12462 to 12320. [2024-11-11 20:40:31,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12320 states, 10209 states have (on average 1.6475658732490939) internal successors, (16820), 10217 states have internal predecessors, (16820), 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-11-11 20:40:31,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12320 states to 12320 states and 21171 transitions. [2024-11-11 20:40:31,676 INFO L78 Accepts]: Start accepts. Automaton has 12320 states and 21171 transitions. Word has length 135 [2024-11-11 20:40:31,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:31,677 INFO L471 AbstractCegarLoop]: Abstraction has 12320 states and 21171 transitions. [2024-11-11 20:40:31,677 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.0) internal successors, (91), 3 states have internal predecessors, (91), 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-11-11 20:40:31,677 INFO L276 IsEmpty]: Start isEmpty. Operand 12320 states and 21171 transitions. [2024-11-11 20:40:31,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-11 20:40:31,709 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:31,709 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:31,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 20:40:31,709 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:31,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:31,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1993121446, now seen corresponding path program 1 times [2024-11-11 20:40:31,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:31,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415358920] [2024-11-11 20:40:31,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:31,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:31,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:31,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:31,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:31,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:31,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:40:31,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:40:31,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:40:31,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:40:31,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:40:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-11 20:40:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-11 20:40:31,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-11 20:40:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:31,854 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:31,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:31,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415358920] [2024-11-11 20:40:31,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1415358920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:31,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:31,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:40:31,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841480247] [2024-11-11 20:40:31,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:31,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:40:31,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:31,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:40:31,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:40:31,857 INFO L87 Difference]: Start difference. First operand 12320 states and 21171 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (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-11-11 20:40:33,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:33,671 INFO L93 Difference]: Finished difference Result 29622 states and 51447 transitions. [2024-11-11 20:40:33,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:40:33,671 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (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 136 [2024-11-11 20:40:33,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:33,758 INFO L225 Difference]: With dead ends: 29622 [2024-11-11 20:40:33,758 INFO L226 Difference]: Without dead ends: 19415 [2024-11-11 20:40:33,795 INFO L434 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-11-11 20:40:33,795 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 1531 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 520 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 951 SdHoareTripleChecker+Invalid, 2067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 520 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:33,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 951 Invalid, 2067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [520 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:40:33,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19415 states. [2024-11-11 20:40:34,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19415 to 19273. [2024-11-11 20:40:34,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19273 states, 15959 states have (on average 1.6222820978758068) internal successors, (25890), 15967 states have internal predecessors, (25890), 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-11-11 20:40:34,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19273 states to 19273 states and 32791 transitions. [2024-11-11 20:40:34,584 INFO L78 Accepts]: Start accepts. Automaton has 19273 states and 32791 transitions. Word has length 136 [2024-11-11 20:40:34,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:34,585 INFO L471 AbstractCegarLoop]: Abstraction has 19273 states and 32791 transitions. [2024-11-11 20:40:34,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (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-11-11 20:40:34,585 INFO L276 IsEmpty]: Start isEmpty. Operand 19273 states and 32791 transitions. [2024-11-11 20:40:34,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-11 20:40:34,614 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:34,614 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:34,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 20:40:34,615 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:34,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:34,615 INFO L85 PathProgramCache]: Analyzing trace with hash -2018922648, now seen corresponding path program 1 times [2024-11-11 20:40:34,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:34,615 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116053742] [2024-11-11 20:40:34,615 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:34,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:34,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:34,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:34,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:34,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:34,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:34,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,811 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:34,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:40:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:40:34,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:40:34,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:40:34,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:40:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-11 20:40:34,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-11 20:40:34,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2024-11-11 20:40:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:34,842 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:34,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:34,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116053742] [2024-11-11 20:40:34,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116053742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:34,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:34,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:40:34,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942554043] [2024-11-11 20:40:34,843 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:34,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:40:34,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:34,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:40:34,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:40:34,845 INFO L87 Difference]: Start difference. First operand 19273 states and 32791 transitions. Second operand has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (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-11-11 20:40:36,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:36,768 INFO L93 Difference]: Finished difference Result 51054 states and 88365 transitions. [2024-11-11 20:40:36,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:40:36,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (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 137 [2024-11-11 20:40:36,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:36,917 INFO L225 Difference]: With dead ends: 51054 [2024-11-11 20:40:36,917 INFO L226 Difference]: Without dead ends: 34536 [2024-11-11 20:40:37,074 INFO L434 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-11-11 20:40:37,075 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 1530 mSDsluCounter, 766 mSDsCounter, 0 mSdLazyCounter, 1547 mSolverCounterSat, 515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 2062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 515 IncrementalHoareTripleChecker+Valid, 1547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:37,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 976 Invalid, 2062 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [515 Valid, 1547 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-11 20:40:37,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34536 states. [2024-11-11 20:40:38,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34536 to 34394. [2024-11-11 20:40:38,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34394 states, 28630 states have (on average 1.61914076143905) internal successors, (46356), 28638 states have internal predecessors, (46356), 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-11-11 20:40:38,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34394 states to 34394 states and 58431 transitions. [2024-11-11 20:40:38,660 INFO L78 Accepts]: Start accepts. Automaton has 34394 states and 58431 transitions. Word has length 137 [2024-11-11 20:40:38,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:38,662 INFO L471 AbstractCegarLoop]: Abstraction has 34394 states and 58431 transitions. [2024-11-11 20:40:38,662 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.285714285714286) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (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-11-11 20:40:38,662 INFO L276 IsEmpty]: Start isEmpty. Operand 34394 states and 58431 transitions. [2024-11-11 20:40:38,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-11 20:40:38,692 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:38,692 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:38,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 20:40:38,692 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:38,693 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:38,693 INFO L85 PathProgramCache]: Analyzing trace with hash 1246015756, now seen corresponding path program 1 times [2024-11-11 20:40:38,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:38,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195975813] [2024-11-11 20:40:38,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:38,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:38,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:38,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:38,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:38,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:38,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:38,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:38,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:38,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:38,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:38,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:38,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:38,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:38,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:40:38,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:38,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:40:38,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:38,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:40:38,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:38,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:40:38,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:38,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:40:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:38,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-11 20:40:38,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:38,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-11 20:40:38,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:38,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2024-11-11 20:40:38,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:38,795 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:38,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:38,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1195975813] [2024-11-11 20:40:38,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1195975813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:38,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:38,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:40:38,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317365975] [2024-11-11 20:40:38,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:38,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:40:38,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:38,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:40:38,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:40:38,797 INFO L87 Difference]: Start difference. First operand 34394 states and 58431 transitions. Second operand has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (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-11-11 20:40:41,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:41,943 INFO L93 Difference]: Finished difference Result 93926 states and 161764 transitions. [2024-11-11 20:40:41,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:40:41,944 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (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 138 [2024-11-11 20:40:41,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:42,214 INFO L225 Difference]: With dead ends: 93926 [2024-11-11 20:40:42,215 INFO L226 Difference]: Without dead ends: 63203 [2024-11-11 20:40:42,309 INFO L434 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-11-11 20:40:42,310 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 1534 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 1516 mSolverCounterSat, 534 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1552 SdHoareTripleChecker+Valid, 983 SdHoareTripleChecker+Invalid, 2050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 534 IncrementalHoareTripleChecker+Valid, 1516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:42,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1552 Valid, 983 Invalid, 2050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [534 Valid, 1516 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 20:40:42,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63203 states. [2024-11-11 20:40:44,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63203 to 63061. [2024-11-11 20:40:44,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63061 states, 52784 states have (on average 1.6149022431039708) internal successors, (85241), 52792 states have internal predecessors, (85241), 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-11-11 20:40:45,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63061 states to 63061 states and 106874 transitions. [2024-11-11 20:40:45,139 INFO L78 Accepts]: Start accepts. Automaton has 63061 states and 106874 transitions. Word has length 138 [2024-11-11 20:40:45,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:45,140 INFO L471 AbstractCegarLoop]: Abstraction has 63061 states and 106874 transitions. [2024-11-11 20:40:45,140 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.428571428571429) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (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-11-11 20:40:45,140 INFO L276 IsEmpty]: Start isEmpty. Operand 63061 states and 106874 transitions. [2024-11-11 20:40:45,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-11 20:40:45,176 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:45,176 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:45,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 20:40:45,176 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:45,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:45,177 INFO L85 PathProgramCache]: Analyzing trace with hash -675372664, now seen corresponding path program 1 times [2024-11-11 20:40:45,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:45,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1974816425] [2024-11-11 20:40:45,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:45,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:45,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:45,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:45,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:45,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:45,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:45,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:45,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:45,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:45,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:45,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:45,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:45,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:40:45,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:45,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:40:45,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:45,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:40:45,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:45,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:40:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:45,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:40:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:45,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-11 20:40:45,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:45,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2024-11-11 20:40:45,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:45,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-11 20:40:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:45,287 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:45,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:45,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1974816425] [2024-11-11 20:40:45,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1974816425] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:45,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:45,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-11 20:40:45,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267386002] [2024-11-11 20:40:45,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:45,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 20:40:45,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:45,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 20:40:45,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-11 20:40:45,291 INFO L87 Difference]: Start difference. First operand 63061 states and 106874 transitions. Second operand has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 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-11-11 20:40:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:40:49,379 INFO L93 Difference]: Finished difference Result 118302 states and 204141 transitions. [2024-11-11 20:40:49,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:40:49,379 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 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 139 [2024-11-11 20:40:49,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:40:49,808 INFO L225 Difference]: With dead ends: 118302 [2024-11-11 20:40:49,808 INFO L226 Difference]: Without dead ends: 118076 [2024-11-11 20:40:49,859 INFO L434 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-11-11 20:40:49,860 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 1525 mSDsluCounter, 794 mSDsCounter, 0 mSdLazyCounter, 1526 mSolverCounterSat, 528 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1543 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 528 IncrementalHoareTripleChecker+Valid, 1526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:40:49,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1543 Valid, 1013 Invalid, 2054 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [528 Valid, 1526 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-11 20:40:49,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118076 states. [2024-11-11 20:40:53,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118076 to 117934. [2024-11-11 20:40:53,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117934 states, 99289 states have (on average 1.6095337852128635) internal successors, (159809), 99297 states have internal predecessors, (159809), 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-11-11 20:40:54,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117934 states to 117934 states and 199224 transitions. [2024-11-11 20:40:54,423 INFO L78 Accepts]: Start accepts. Automaton has 117934 states and 199224 transitions. Word has length 139 [2024-11-11 20:40:54,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:40:54,424 INFO L471 AbstractCegarLoop]: Abstraction has 117934 states and 199224 transitions. [2024-11-11 20:40:54,424 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.571428571428571) internal successors, (95), 3 states have internal predecessors, (95), 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-11-11 20:40:54,424 INFO L276 IsEmpty]: Start isEmpty. Operand 117934 states and 199224 transitions. [2024-11-11 20:40:54,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-11 20:40:54,474 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:40:54,474 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:40:54,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 20:40:54,474 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:40:54,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:40:54,475 INFO L85 PathProgramCache]: Analyzing trace with hash 197221997, now seen corresponding path program 1 times [2024-11-11 20:40:54,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:40:54,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501991802] [2024-11-11 20:40:54,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:40:54,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:40:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:40:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:40:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:40:54,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:40:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:40:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:40:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:40:54,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:40:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:40:54,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:40:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:40:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-11-11 20:40:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2024-11-11 20:40:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-11 20:40:54,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:40:54,922 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:40:54,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:40:54,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501991802] [2024-11-11 20:40:54,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501991802] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:40:54,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:40:54,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-11-11 20:40:54,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737621058] [2024-11-11 20:40:54,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:40:54,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-11 20:40:54,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:40:54,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-11 20:40:54,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2024-11-11 20:40:54,925 INFO L87 Difference]: Start difference. First operand 117934 states and 199224 transitions. Second operand has 18 states, 16 states have (on average 6.0) internal successors, (96), 12 states have internal predecessors, (96), 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-11-11 20:41:06,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:41:06,987 INFO L93 Difference]: Finished difference Result 235631 states and 409995 transitions. [2024-11-11 20:41:06,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-11 20:41:06,987 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0) internal successors, (96), 12 states have internal predecessors, (96), 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 140 [2024-11-11 20:41:06,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:41:08,022 INFO L225 Difference]: With dead ends: 235631 [2024-11-11 20:41:08,022 INFO L226 Difference]: Without dead ends: 235411 [2024-11-11 20:41:08,099 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1385 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=900, Invalid=4070, Unknown=0, NotChecked=0, Total=4970 [2024-11-11 20:41:08,100 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 5747 mSDsluCounter, 3177 mSDsCounter, 0 mSdLazyCounter, 9423 mSolverCounterSat, 2120 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5747 SdHoareTripleChecker+Valid, 3441 SdHoareTripleChecker+Invalid, 11543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2120 IncrementalHoareTripleChecker+Valid, 9423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:41:08,100 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5747 Valid, 3441 Invalid, 11543 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2120 Valid, 9423 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2024-11-11 20:41:08,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235411 states.