./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec6_product35.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec6_product35.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b1644ee409dd7fb9188781699149bb283de125dad063a54175775584b617862 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:55:47,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:55:48,037 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:55:48,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:55:48,041 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:55:48,055 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:55:48,056 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:55:48,056 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:55:48,060 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:55:48,060 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:55:48,060 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:55:48,060 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:55:48,060 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:55:48,060 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:55:48,060 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:55:48,060 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:55:48,060 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:55:48,060 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:55:48,060 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:55:48,060 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:55:48,060 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:55:48,061 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:55:48,061 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:55:48,061 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:55:48,061 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:55:48,061 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:55:48,061 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:55:48,061 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:55:48,061 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:55:48,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:55:48,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:55:48,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:55:48,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:55:48,061 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:55:48,061 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:55:48,061 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:55:48,061 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:55:48,061 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:55:48,061 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:55:48,061 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:55:48,062 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:55:48,062 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:55:48,062 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:55:48,062 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:55:48,062 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:55:48,062 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:55:48,062 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:55:48,062 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:55:48,062 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b1644ee409dd7fb9188781699149bb283de125dad063a54175775584b617862 [2025-01-09 03:55:48,261 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:55:48,267 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:55:48,270 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:55:48,270 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:55:48,271 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:55:48,271 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec6_product35.cil.c [2025-01-09 03:55:49,467 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e3aa85e6/57467b24b4f14f398e35b3ba0bd9083a/FLAGfa069a1fc [2025-01-09 03:55:49,877 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:55:49,877 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product35.cil.c [2025-01-09 03:55:49,903 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e3aa85e6/57467b24b4f14f398e35b3ba0bd9083a/FLAGfa069a1fc [2025-01-09 03:55:50,042 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e3aa85e6/57467b24b4f14f398e35b3ba0bd9083a [2025-01-09 03:55:50,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:55:50,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:55:50,046 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:55:50,046 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:55:50,049 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:55:50,050 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,051 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7475c7d5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50, skipping insertion in model container [2025-01-09 03:55:50,051 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,097 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:55:50,412 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product35.cil.c[24735,24748] [2025-01-09 03:55:50,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:55:50,557 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:55:50,564 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [48] [2025-01-09 03:55:50,565 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [530] [2025-01-09 03:55:50,565 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptDecrypt_spec.i","") [854] [2025-01-09 03:55:50,565 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [901] [2025-01-09 03:55:50,565 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1123] [2025-01-09 03:55:50,565 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1260] [2025-01-09 03:55:50,565 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1269] [2025-01-09 03:55:50,566 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2329] [2025-01-09 03:55:50,566 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2695] [2025-01-09 03:55:50,566 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [3092] [2025-01-09 03:55:50,566 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [3109] [2025-01-09 03:55:50,601 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product35.cil.c[24735,24748] [2025-01-09 03:55:50,654 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:55:50,681 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:55:50,681 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50 WrapperNode [2025-01-09 03:55:50,684 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:55:50,685 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:55:50,685 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:55:50,685 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:55:50,695 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,713 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,781 INFO L138 Inliner]: procedures = 138, calls = 232, calls flagged for inlining = 67, calls inlined = 64, statements flattened = 1177 [2025-01-09 03:55:50,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:55:50,782 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:55:50,782 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:55:50,782 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:55:50,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,796 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,844 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-01-09 03:55:50,844 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,845 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,868 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,874 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,883 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,890 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,896 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,910 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:55:50,911 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:55:50,914 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:55:50,914 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:55:50,915 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (1/1) ... [2025-01-09 03:55:50,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:55:50,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:50,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:55:50,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:55:50,966 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:55:50,966 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:55:50,966 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-01-09 03:55:50,967 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-01-09 03:55:50,967 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:55:50,967 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:55:50,967 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-01-09 03:55:50,967 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-01-09 03:55:50,967 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:55:50,967 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:55:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:55:50,968 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:55:50,968 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-01-09 03:55:50,968 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-01-09 03:55:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:55:50,969 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:55:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:55:50,969 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:55:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:55:50,969 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:55:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:55:50,969 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:55:50,969 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:55:50,970 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:55:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:55:50,970 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:55:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:55:50,970 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:55:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-01-09 03:55:50,970 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-01-09 03:55:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:55:50,970 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:55:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:55:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:55:50,970 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:55:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:55:50,970 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:55:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-01-09 03:55:50,970 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-01-09 03:55:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:55:50,970 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:55:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:55:50,970 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:55:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:55:50,970 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:55:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:55:50,970 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:55:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:55:50,970 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:55:50,970 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:55:50,971 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:55:50,971 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:55:50,973 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:55:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:55:50,973 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:55:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:55:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:55:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:55:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:55:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:55:50,973 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:55:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-01-09 03:55:50,973 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-01-09 03:55:50,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:55:50,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:55:51,181 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:55:51,183 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:55:52,151 INFO L? ?]: Removed 612 outVars from TransFormulas that were not future-live. [2025-01-09 03:55:52,151 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:55:52,172 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:55:52,172 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:55:52,172 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:55:52 BoogieIcfgContainer [2025-01-09 03:55:52,172 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:55:52,176 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:55:52,176 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:55:52,180 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:55:52,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:55:50" (1/3) ... [2025-01-09 03:55:52,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295612e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:55:52, skipping insertion in model container [2025-01-09 03:55:52,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:50" (2/3) ... [2025-01-09 03:55:52,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@295612e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:55:52, skipping insertion in model container [2025-01-09 03:55:52,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:55:52" (3/3) ... [2025-01-09 03:55:52,182 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec6_product35.cil.c [2025-01-09 03:55:52,193 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:55:52,196 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec6_product35.cil.c that has 30 procedures, 470 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:55:52,241 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:55:52,249 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;@7358e619, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:55:52,249 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:55:52,253 INFO L276 IsEmpty]: Start isEmpty. Operand has 470 states, 362 states have (on average 1.5303867403314917) internal successors, (554), 367 states have internal predecessors, (554), 77 states have call successors, (77), 29 states have call predecessors, (77), 29 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2025-01-09 03:55:52,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 03:55:52,265 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:52,266 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:52,266 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:52,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:52,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1983771081, now seen corresponding path program 1 times [2025-01-09 03:55:52,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:52,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130448115] [2025-01-09 03:55:52,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:52,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:52,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 03:55:52,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 03:55:52,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:52,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:52,979 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:55:52,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:52,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130448115] [2025-01-09 03:55:52,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130448115] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:52,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966302041] [2025-01-09 03:55:52,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:52,980 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:52,980 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:52,984 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:55:52,985 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:55:53,144 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 03:55:53,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 03:55:53,263 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:53,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:53,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 1220 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:55:53,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:53,318 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:55:53,318 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:53,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966302041] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:53,319 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:53,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:55:53,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1326629232] [2025-01-09 03:55:53,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:53,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:53,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:53,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:53,360 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:55:53,362 INFO L87 Difference]: Start difference. First operand has 470 states, 362 states have (on average 1.5303867403314917) internal successors, (554), 367 states have internal predecessors, (554), 77 states have call successors, (77), 29 states have call predecessors, (77), 29 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:53,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:53,451 INFO L93 Difference]: Finished difference Result 745 states and 1104 transitions. [2025-01-09 03:55:53,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:53,453 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 135 [2025-01-09 03:55:53,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:53,469 INFO L225 Difference]: With dead ends: 745 [2025-01-09 03:55:53,469 INFO L226 Difference]: Without dead ends: 465 [2025-01-09 03:55:53,473 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:55:53,475 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 1 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1403 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:53,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1403 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:53,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-01-09 03:55:53,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 464. [2025-01-09 03:55:53,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 357 states have (on average 1.526610644257703) internal successors, (545), 361 states have internal predecessors, (545), 77 states have call successors, (77), 29 states have call predecessors, (77), 29 states have return successors, (76), 75 states have call predecessors, (76), 76 states have call successors, (76) [2025-01-09 03:55:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 698 transitions. [2025-01-09 03:55:53,524 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 698 transitions. Word has length 135 [2025-01-09 03:55:53,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:53,525 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 698 transitions. [2025-01-09 03:55:53,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:53,525 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 698 transitions. [2025-01-09 03:55:53,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 03:55:53,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:53,531 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:53,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:55:53,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 03:55:53,735 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:53,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:53,736 INFO L85 PathProgramCache]: Analyzing trace with hash 1812657540, now seen corresponding path program 1 times [2025-01-09 03:55:53,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:53,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063958911] [2025-01-09 03:55:53,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:53,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:53,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 03:55:53,793 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 03:55:53,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:53,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:54,046 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 03:55:54,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:54,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063958911] [2025-01-09 03:55:54,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063958911] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:54,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959968864] [2025-01-09 03:55:54,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:54,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:54,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:54,053 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:55:54,055 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:55:54,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 03:55:54,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 03:55:54,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:54,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:54,367 INFO L256 TraceCheckSpWp]: Trace formula consists of 1244 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:55:54,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:54,405 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:55:54,408 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:54,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959968864] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:54,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:54,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:55:54,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [39614965] [2025-01-09 03:55:54,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:54,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:54,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:54,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:54,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:55:54,412 INFO L87 Difference]: Start difference. First operand 464 states and 698 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:54,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:54,469 INFO L93 Difference]: Finished difference Result 981 states and 1496 transitions. [2025-01-09 03:55:54,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:54,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 143 [2025-01-09 03:55:54,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:54,477 INFO L225 Difference]: With dead ends: 981 [2025-01-09 03:55:54,478 INFO L226 Difference]: Without dead ends: 543 [2025-01-09 03:55:54,482 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:55:54,482 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 142 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:54,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1351 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-01-09 03:55:54,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 535. [2025-01-09 03:55:54,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 535 states, 414 states have (on average 1.5483091787439613) internal successors, (641), 418 states have internal predecessors, (641), 91 states have call successors, (91), 29 states have call predecessors, (91), 29 states have return successors, (90), 89 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 03:55:54,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 535 states to 535 states and 822 transitions. [2025-01-09 03:55:54,525 INFO L78 Accepts]: Start accepts. Automaton has 535 states and 822 transitions. Word has length 143 [2025-01-09 03:55:54,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:54,525 INFO L471 AbstractCegarLoop]: Abstraction has 535 states and 822 transitions. [2025-01-09 03:55:54,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:54,525 INFO L276 IsEmpty]: Start isEmpty. Operand 535 states and 822 transitions. [2025-01-09 03:55:54,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 03:55:54,530 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:54,531 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:54,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:55:54,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:54,736 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:54,736 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:54,737 INFO L85 PathProgramCache]: Analyzing trace with hash -1330038796, now seen corresponding path program 1 times [2025-01-09 03:55:54,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:54,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095311616] [2025-01-09 03:55:54,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:54,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:54,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 03:55:54,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 03:55:54,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:54,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:54,944 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 03:55:54,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:54,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095311616] [2025-01-09 03:55:54,944 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095311616] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:54,944 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312550123] [2025-01-09 03:55:54,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:54,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:54,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:54,947 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:55:54,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:55:55,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 03:55:55,263 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 03:55:55,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:55,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:55,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 1249 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:55:55,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:55,328 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 03:55:55,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:55,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312550123] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:55,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:55,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:55:55,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625862894] [2025-01-09 03:55:55,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:55,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:55:55,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:55,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:55:55,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:55:55,331 INFO L87 Difference]: Start difference. First operand 535 states and 822 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:55:55,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:55,403 INFO L93 Difference]: Finished difference Result 1061 states and 1634 transitions. [2025-01-09 03:55:55,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:55:55,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 144 [2025-01-09 03:55:55,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:55,408 INFO L225 Difference]: With dead ends: 1061 [2025-01-09 03:55:55,408 INFO L226 Difference]: Without dead ends: 537 [2025-01-09 03:55:55,412 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 142 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:55:55,415 INFO L435 NwaCegarLoop]: 689 mSDtfsCounter, 2 mSDsluCounter, 2056 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2745 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:55,415 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2745 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:55,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 537 states. [2025-01-09 03:55:55,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 537 to 537. [2025-01-09 03:55:55,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 415 states have (on average 1.546987951807229) internal successors, (642), 420 states have internal predecessors, (642), 91 states have call successors, (91), 29 states have call predecessors, (91), 30 states have return successors, (92), 89 states have call predecessors, (92), 90 states have call successors, (92) [2025-01-09 03:55:55,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 825 transitions. [2025-01-09 03:55:55,452 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 825 transitions. Word has length 144 [2025-01-09 03:55:55,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:55,452 INFO L471 AbstractCegarLoop]: Abstraction has 537 states and 825 transitions. [2025-01-09 03:55:55,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:55:55,453 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 825 transitions. [2025-01-09 03:55:55,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 03:55:55,459 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:55,460 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:55,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 03:55:55,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:55,661 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:55,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:55,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1002559134, now seen corresponding path program 1 times [2025-01-09 03:55:55,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:55,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112839354] [2025-01-09 03:55:55,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:55,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:55,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 03:55:55,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 03:55:55,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:55,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:55,989 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 03:55:55,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:55,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112839354] [2025-01-09 03:55:55,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112839354] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:55,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806308849] [2025-01-09 03:55:55,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:55,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:55,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:55,995 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:55:55,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:55:56,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 03:55:56,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 03:55:56,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:56,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:56,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 1250 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:55:56,299 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:56,346 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-09 03:55:56,346 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:56,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [806308849] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:56,347 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:56,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:55:56,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136888112] [2025-01-09 03:55:56,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:56,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:55:56,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:56,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:55:56,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:55:56,352 INFO L87 Difference]: Start difference. First operand 537 states and 825 transitions. Second operand has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:55:56,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:56,418 INFO L93 Difference]: Finished difference Result 1063 states and 1639 transitions. [2025-01-09 03:55:56,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:55:56,418 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 145 [2025-01-09 03:55:56,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:56,421 INFO L225 Difference]: With dead ends: 1063 [2025-01-09 03:55:56,421 INFO L226 Difference]: Without dead ends: 539 [2025-01-09 03:55:56,423 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:55:56,424 INFO L435 NwaCegarLoop]: 687 mSDtfsCounter, 2 mSDsluCounter, 2044 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2731 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:56,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2731 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:56,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-01-09 03:55:56,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2025-01-09 03:55:56,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 416 states have (on average 1.5456730769230769) internal successors, (643), 422 states have internal predecessors, (643), 91 states have call successors, (91), 29 states have call predecessors, (91), 31 states have return successors, (97), 89 states have call predecessors, (97), 90 states have call successors, (97) [2025-01-09 03:55:56,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 831 transitions. [2025-01-09 03:55:56,443 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 831 transitions. Word has length 145 [2025-01-09 03:55:56,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:56,443 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 831 transitions. [2025-01-09 03:55:56,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.0) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:55:56,443 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 831 transitions. [2025-01-09 03:55:56,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 03:55:56,445 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:56,445 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:56,454 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:55:56,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:56,646 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:56,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:56,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1169663336, now seen corresponding path program 1 times [2025-01-09 03:55:56,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:56,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379117751] [2025-01-09 03:55:56,646 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:56,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:56,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 03:55:56,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 03:55:56,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:56,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:56,791 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 43 trivial. 0 not checked. [2025-01-09 03:55:56,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:56,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379117751] [2025-01-09 03:55:56,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379117751] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:56,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:56,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:55:56,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081668212] [2025-01-09 03:55:56,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:56,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:55:56,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:56,792 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:55:56,792 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:56,792 INFO L87 Difference]: Start difference. First operand 539 states and 831 transitions. Second operand has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 03:55:56,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:56,860 INFO L93 Difference]: Finished difference Result 1055 states and 1630 transitions. [2025-01-09 03:55:56,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:55:56,861 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) Word has length 165 [2025-01-09 03:55:56,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:56,864 INFO L225 Difference]: With dead ends: 1055 [2025-01-09 03:55:56,864 INFO L226 Difference]: Without dead ends: 539 [2025-01-09 03:55:56,866 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:56,866 INFO L435 NwaCegarLoop]: 690 mSDtfsCounter, 2 mSDsluCounter, 2059 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2749 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:56,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2749 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:56,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-01-09 03:55:56,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2025-01-09 03:55:56,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 416 states have (on average 1.5456730769230769) internal successors, (643), 422 states have internal predecessors, (643), 91 states have call successors, (91), 29 states have call predecessors, (91), 31 states have return successors, (96), 89 states have call predecessors, (96), 90 states have call successors, (96) [2025-01-09 03:55:56,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 830 transitions. [2025-01-09 03:55:56,887 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 830 transitions. Word has length 165 [2025-01-09 03:55:56,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:56,888 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 830 transitions. [2025-01-09 03:55:56,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 24.5) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 2 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 03:55:56,888 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 830 transitions. [2025-01-09 03:55:56,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 03:55:56,891 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:56,891 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:56,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:55:56,892 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:56,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:56,892 INFO L85 PathProgramCache]: Analyzing trace with hash -165033976, now seen corresponding path program 2 times [2025-01-09 03:55:56,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:56,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459394911] [2025-01-09 03:55:56,893 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:55:56,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:56,916 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 166 statements into 2 equivalence classes. [2025-01-09 03:55:56,929 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 03:55:56,929 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:55:56,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:57,028 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 03:55:57,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:57,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459394911] [2025-01-09 03:55:57,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459394911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:57,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:57,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:55:57,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735035501] [2025-01-09 03:55:57,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:57,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:55:57,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:57,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:55:57,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:57,030 INFO L87 Difference]: Start difference. First operand 539 states and 830 transitions. Second operand has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 03:55:57,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:57,080 INFO L93 Difference]: Finished difference Result 1053 states and 1625 transitions. [2025-01-09 03:55:57,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:55:57,080 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 166 [2025-01-09 03:55:57,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:57,086 INFO L225 Difference]: With dead ends: 1053 [2025-01-09 03:55:57,086 INFO L226 Difference]: Without dead ends: 539 [2025-01-09 03:55:57,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:57,088 INFO L435 NwaCegarLoop]: 688 mSDtfsCounter, 2 mSDsluCounter, 2047 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2735 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:57,088 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2735 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:57,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2025-01-09 03:55:57,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 539. [2025-01-09 03:55:57,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 416 states have (on average 1.5456730769230769) internal successors, (643), 422 states have internal predecessors, (643), 91 states have call successors, (91), 29 states have call predecessors, (91), 31 states have return successors, (95), 89 states have call predecessors, (95), 90 states have call successors, (95) [2025-01-09 03:55:57,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 829 transitions. [2025-01-09 03:55:57,109 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 829 transitions. Word has length 166 [2025-01-09 03:55:57,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:57,109 INFO L471 AbstractCegarLoop]: Abstraction has 539 states and 829 transitions. [2025-01-09 03:55:57,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.6) internal successors, (98), 5 states have internal predecessors, (98), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 03:55:57,109 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 829 transitions. [2025-01-09 03:55:57,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 03:55:57,111 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:57,112 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:57,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:55:57,112 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:57,112 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:57,112 INFO L85 PathProgramCache]: Analyzing trace with hash 54875257, now seen corresponding path program 3 times [2025-01-09 03:55:57,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:57,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426043868] [2025-01-09 03:55:57,112 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:55:57,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:57,133 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 167 statements into 3 equivalence classes. [2025-01-09 03:55:57,141 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 117 of 167 statements. [2025-01-09 03:55:57,141 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:55:57,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:57,251 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 03:55:57,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:57,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426043868] [2025-01-09 03:55:57,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426043868] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:57,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:57,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:55:57,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554671486] [2025-01-09 03:55:57,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:57,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:55:57,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:57,252 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:55:57,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:57,253 INFO L87 Difference]: Start difference. First operand 539 states and 829 transitions. Second operand has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 03:55:57,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:57,311 INFO L93 Difference]: Finished difference Result 1055 states and 1631 transitions. [2025-01-09 03:55:57,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:55:57,312 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 167 [2025-01-09 03:55:57,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:57,315 INFO L225 Difference]: With dead ends: 1055 [2025-01-09 03:55:57,315 INFO L226 Difference]: Without dead ends: 541 [2025-01-09 03:55:57,317 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:57,317 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 1 mSDsluCounter, 2055 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2746 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:57,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2746 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:57,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-01-09 03:55:57,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 541. [2025-01-09 03:55:57,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 541 states, 417 states have (on average 1.5443645083932853) internal successors, (644), 424 states have internal predecessors, (644), 91 states have call successors, (91), 29 states have call predecessors, (91), 32 states have return successors, (100), 89 states have call predecessors, (100), 90 states have call successors, (100) [2025-01-09 03:55:57,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 541 states to 541 states and 835 transitions. [2025-01-09 03:55:57,336 INFO L78 Accepts]: Start accepts. Automaton has 541 states and 835 transitions. Word has length 167 [2025-01-09 03:55:57,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:57,336 INFO L471 AbstractCegarLoop]: Abstraction has 541 states and 835 transitions. [2025-01-09 03:55:57,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.8) internal successors, (99), 5 states have internal predecessors, (99), 3 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-01-09 03:55:57,336 INFO L276 IsEmpty]: Start isEmpty. Operand 541 states and 835 transitions. [2025-01-09 03:55:57,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 03:55:57,338 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:57,338 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:57,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:55:57,339 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:57,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:57,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1410146618, now seen corresponding path program 1 times [2025-01-09 03:55:57,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:57,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739983059] [2025-01-09 03:55:57,339 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:57,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:57,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 03:55:57,367 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 03:55:57,367 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:57,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:57,501 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:55:57,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:57,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739983059] [2025-01-09 03:55:57,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739983059] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:57,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:57,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:55:57,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725513595] [2025-01-09 03:55:57,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:57,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:55:57,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:57,502 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:55:57,502 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:57,503 INFO L87 Difference]: Start difference. First operand 541 states and 835 transitions. Second operand has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:55:57,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:57,544 INFO L93 Difference]: Finished difference Result 1061 states and 1641 transitions. [2025-01-09 03:55:57,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:55:57,544 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) Word has length 149 [2025-01-09 03:55:57,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:57,548 INFO L225 Difference]: With dead ends: 1061 [2025-01-09 03:55:57,548 INFO L226 Difference]: Without dead ends: 543 [2025-01-09 03:55:57,549 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:57,551 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 1 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2752 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:57,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2752 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:57,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 543 states. [2025-01-09 03:55:57,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 543 to 543. [2025-01-09 03:55:57,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 543 states, 418 states have (on average 1.5430622009569377) internal successors, (645), 426 states have internal predecessors, (645), 91 states have call successors, (91), 29 states have call predecessors, (91), 33 states have return successors, (102), 89 states have call predecessors, (102), 90 states have call successors, (102) [2025-01-09 03:55:57,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 838 transitions. [2025-01-09 03:55:57,568 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 838 transitions. Word has length 149 [2025-01-09 03:55:57,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:57,569 INFO L471 AbstractCegarLoop]: Abstraction has 543 states and 838 transitions. [2025-01-09 03:55:57,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.5) internal successors, (94), 5 states have internal predecessors, (94), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (18), 2 states have call predecessors, (18), 3 states have call successors, (18) [2025-01-09 03:55:57,569 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 838 transitions. [2025-01-09 03:55:57,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 03:55:57,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:57,571 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:57,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:55:57,571 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:57,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:57,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1406839483, now seen corresponding path program 1 times [2025-01-09 03:55:57,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:57,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1370527502] [2025-01-09 03:55:57,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:57,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:57,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 03:55:57,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 03:55:57,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:57,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:57,772 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 03:55:57,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:57,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1370527502] [2025-01-09 03:55:57,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1370527502] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:57,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365095236] [2025-01-09 03:55:57,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:57,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:57,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:57,775 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:55:57,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:55:57,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 03:55:58,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 03:55:58,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:58,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:58,067 INFO L256 TraceCheckSpWp]: Trace formula consists of 1255 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:55:58,070 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:58,098 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:55:58,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:55:58,185 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:55:58,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365095236] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:55:58,185 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:55:58,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-01-09 03:55:58,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130809411] [2025-01-09 03:55:58,185 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:55:58,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:55:58,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:58,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:55:58,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:55:58,186 INFO L87 Difference]: Start difference. First operand 543 states and 838 transitions. Second operand has 11 states, 10 states have (on average 15.1) internal successors, (151), 11 states have internal predecessors, (151), 4 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-01-09 03:55:58,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:58,792 INFO L93 Difference]: Finished difference Result 1521 states and 2446 transitions. [2025-01-09 03:55:58,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:55:58,792 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 15.1) internal successors, (151), 11 states have internal predecessors, (151), 4 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) Word has length 150 [2025-01-09 03:55:58,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:58,798 INFO L225 Difference]: With dead ends: 1521 [2025-01-09 03:55:58,798 INFO L226 Difference]: Without dead ends: 1006 [2025-01-09 03:55:58,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-01-09 03:55:58,800 INFO L435 NwaCegarLoop]: 698 mSDtfsCounter, 1530 mSDsluCounter, 4257 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1530 SdHoareTripleChecker+Valid, 4955 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:58,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1530 Valid, 4955 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:55:58,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2025-01-09 03:55:58,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 982. [2025-01-09 03:55:58,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 778 states have (on average 1.6028277634961439) internal successors, (1247), 785 states have internal predecessors, (1247), 170 states have call successors, (170), 30 states have call predecessors, (170), 33 states have return successors, (191), 168 states have call predecessors, (191), 169 states have call successors, (191) [2025-01-09 03:55:58,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1608 transitions. [2025-01-09 03:55:58,836 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1608 transitions. Word has length 150 [2025-01-09 03:55:58,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:58,836 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1608 transitions. [2025-01-09 03:55:58,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 15.1) internal successors, (151), 11 states have internal predecessors, (151), 4 states have call successors, (37), 2 states have call predecessors, (37), 3 states have return successors, (34), 3 states have call predecessors, (34), 4 states have call successors, (34) [2025-01-09 03:55:58,837 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1608 transitions. [2025-01-09 03:55:58,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 03:55:58,841 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:58,841 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:58,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:55:59,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:59,041 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:59,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:59,042 INFO L85 PathProgramCache]: Analyzing trace with hash 1331224030, now seen corresponding path program 1 times [2025-01-09 03:55:59,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:59,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581861669] [2025-01-09 03:55:59,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:59,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:59,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 03:55:59,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 03:55:59,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:59,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:59,118 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:55:59,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:59,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581861669] [2025-01-09 03:55:59,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581861669] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:59,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:59,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:59,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267614229] [2025-01-09 03:55:59,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:59,119 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:59,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:59,119 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:59,119 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:59,119 INFO L87 Difference]: Start difference. First operand 982 states and 1608 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:59,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:59,160 INFO L93 Difference]: Finished difference Result 2302 states and 3832 transitions. [2025-01-09 03:55:59,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:59,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 154 [2025-01-09 03:55:59,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:59,168 INFO L225 Difference]: With dead ends: 2302 [2025-01-09 03:55:59,168 INFO L226 Difference]: Without dead ends: 1398 [2025-01-09 03:55:59,171 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:59,171 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 139 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:59,171 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1389 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:59,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1398 states. [2025-01-09 03:55:59,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1398 to 1390. [2025-01-09 03:55:59,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1390 states, 1107 states have (on average 1.6260162601626016) internal successors, (1800), 1114 states have internal predecessors, (1800), 249 states have call successors, (249), 30 states have call predecessors, (249), 33 states have return successors, (280), 247 states have call predecessors, (280), 248 states have call successors, (280) [2025-01-09 03:55:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1390 states to 1390 states and 2329 transitions. [2025-01-09 03:55:59,225 INFO L78 Accepts]: Start accepts. Automaton has 1390 states and 2329 transitions. Word has length 154 [2025-01-09 03:55:59,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:59,225 INFO L471 AbstractCegarLoop]: Abstraction has 1390 states and 2329 transitions. [2025-01-09 03:55:59,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:59,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1390 states and 2329 transitions. [2025-01-09 03:55:59,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 03:55:59,232 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:59,232 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:59,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:55:59,232 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:59,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:59,232 INFO L85 PathProgramCache]: Analyzing trace with hash -177236648, now seen corresponding path program 1 times [2025-01-09 03:55:59,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:59,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268175157] [2025-01-09 03:55:59,233 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:59,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:59,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 03:55:59,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 03:55:59,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:59,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:59,286 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 03:55:59,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:59,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268175157] [2025-01-09 03:55:59,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268175157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:59,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:59,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:59,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886668618] [2025-01-09 03:55:59,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:59,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:59,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:59,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:59,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:59,288 INFO L87 Difference]: Start difference. First operand 1390 states and 2329 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:55:59,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:59,344 INFO L93 Difference]: Finished difference Result 3324 states and 5612 transitions. [2025-01-09 03:55:59,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:59,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 174 [2025-01-09 03:55:59,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:59,354 INFO L225 Difference]: With dead ends: 3324 [2025-01-09 03:55:59,354 INFO L226 Difference]: Without dead ends: 2063 [2025-01-09 03:55:59,358 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:59,358 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 137 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:59,359 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1394 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2063 states. [2025-01-09 03:55:59,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2063 to 2055. [2025-01-09 03:55:59,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2055 states, 1653 states have (on average 1.6394434361766486) internal successors, (2710), 1660 states have internal predecessors, (2710), 368 states have call successors, (368), 30 states have call predecessors, (368), 33 states have return successors, (399), 366 states have call predecessors, (399), 367 states have call successors, (399) [2025-01-09 03:55:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2055 states to 2055 states and 3477 transitions. [2025-01-09 03:55:59,479 INFO L78 Accepts]: Start accepts. Automaton has 2055 states and 3477 transitions. Word has length 174 [2025-01-09 03:55:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:59,479 INFO L471 AbstractCegarLoop]: Abstraction has 2055 states and 3477 transitions. [2025-01-09 03:55:59,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:55:59,480 INFO L276 IsEmpty]: Start isEmpty. Operand 2055 states and 3477 transitions. [2025-01-09 03:55:59,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 03:55:59,489 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:59,489 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:59,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:55:59,489 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:59,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:59,490 INFO L85 PathProgramCache]: Analyzing trace with hash 734380236, now seen corresponding path program 1 times [2025-01-09 03:55:59,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:59,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101133737] [2025-01-09 03:55:59,490 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:59,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:59,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 03:55:59,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 03:55:59,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:59,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:59,543 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:55:59,543 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:59,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101133737] [2025-01-09 03:55:59,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101133737] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:59,543 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:59,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:59,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472957794] [2025-01-09 03:55:59,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:59,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:59,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:59,544 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:59,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:59,544 INFO L87 Difference]: Start difference. First operand 2055 states and 3477 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:59,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:59,623 INFO L93 Difference]: Finished difference Result 4881 states and 8329 transitions. [2025-01-09 03:55:59,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:59,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 156 [2025-01-09 03:55:59,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:59,638 INFO L225 Difference]: With dead ends: 4881 [2025-01-09 03:55:59,638 INFO L226 Difference]: Without dead ends: 3086 [2025-01-09 03:55:59,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:59,644 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 135 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:59,644 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1381 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:59,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3086 states. [2025-01-09 03:55:59,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3086 to 3078. [2025-01-09 03:55:59,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3078 states, 2514 states have (on average 1.6499602227525856) internal successors, (4148), 2521 states have internal predecessors, (4148), 530 states have call successors, (530), 30 states have call predecessors, (530), 33 states have return successors, (577), 528 states have call predecessors, (577), 529 states have call successors, (577) [2025-01-09 03:55:59,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3078 states to 3078 states and 5255 transitions. [2025-01-09 03:55:59,772 INFO L78 Accepts]: Start accepts. Automaton has 3078 states and 5255 transitions. Word has length 156 [2025-01-09 03:55:59,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:59,772 INFO L471 AbstractCegarLoop]: Abstraction has 3078 states and 5255 transitions. [2025-01-09 03:55:59,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:55:59,772 INFO L276 IsEmpty]: Start isEmpty. Operand 3078 states and 5255 transitions. [2025-01-09 03:55:59,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 03:55:59,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:59,787 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:59,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:55:59,787 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:59,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:59,788 INFO L85 PathProgramCache]: Analyzing trace with hash -70429129, now seen corresponding path program 1 times [2025-01-09 03:55:59,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:59,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671749670] [2025-01-09 03:55:59,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:59,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:59,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 03:55:59,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 03:55:59,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:59,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:59,882 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 03:55:59,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:59,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671749670] [2025-01-09 03:55:59,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671749670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:59,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:59,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:59,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327775711] [2025-01-09 03:55:59,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:59,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:59,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:59,883 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:59,883 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:59,884 INFO L87 Difference]: Start difference. First operand 3078 states and 5255 transitions. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:56:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:00,037 INFO L93 Difference]: Finished difference Result 7349 states and 12641 transitions. [2025-01-09 03:56:00,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:00,038 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 176 [2025-01-09 03:56:00,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:00,067 INFO L225 Difference]: With dead ends: 7349 [2025-01-09 03:56:00,067 INFO L226 Difference]: Without dead ends: 4743 [2025-01-09 03:56:00,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:00,078 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 133 mSDsluCounter, 686 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1381 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:00,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1381 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:00,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4743 states. [2025-01-09 03:56:00,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4743 to 4735. [2025-01-09 03:56:00,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4735 states, 3926 states have (on average 1.6574121242995414) internal successors, (6507), 3933 states have internal predecessors, (6507), 775 states have call successors, (775), 30 states have call predecessors, (775), 33 states have return successors, (848), 773 states have call predecessors, (848), 774 states have call successors, (848) [2025-01-09 03:56:00,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4735 states to 4735 states and 8130 transitions. [2025-01-09 03:56:00,330 INFO L78 Accepts]: Start accepts. Automaton has 4735 states and 8130 transitions. Word has length 176 [2025-01-09 03:56:00,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:00,330 INFO L471 AbstractCegarLoop]: Abstraction has 4735 states and 8130 transitions. [2025-01-09 03:56:00,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:56:00,330 INFO L276 IsEmpty]: Start isEmpty. Operand 4735 states and 8130 transitions. [2025-01-09 03:56:00,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 03:56:00,352 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:00,352 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:00,352 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:56:00,352 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:00,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:00,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1833061480, now seen corresponding path program 1 times [2025-01-09 03:56:00,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:00,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323310795] [2025-01-09 03:56:00,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:00,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:00,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 03:56:00,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 03:56:00,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:00,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:00,406 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:00,406 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:00,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323310795] [2025-01-09 03:56:00,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323310795] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:00,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:00,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:00,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498057202] [2025-01-09 03:56:00,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:00,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:00,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:00,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:00,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:00,408 INFO L87 Difference]: Start difference. First operand 4735 states and 8130 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:56:00,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:00,582 INFO L93 Difference]: Finished difference Result 11473 states and 19841 transitions. [2025-01-09 03:56:00,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:00,583 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 158 [2025-01-09 03:56:00,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:00,616 INFO L225 Difference]: With dead ends: 11473 [2025-01-09 03:56:00,616 INFO L226 Difference]: Without dead ends: 7531 [2025-01-09 03:56:00,629 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:00,630 INFO L435 NwaCegarLoop]: 699 mSDtfsCounter, 131 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1383 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:00,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1383 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:00,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7531 states. [2025-01-09 03:56:00,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7531 to 7523. [2025-01-09 03:56:00,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7523 states, 6221 states have (on average 1.6574505706478058) internal successors, (10311), 6228 states have internal predecessors, (10311), 1268 states have call successors, (1268), 30 states have call predecessors, (1268), 33 states have return successors, (1385), 1266 states have call predecessors, (1385), 1267 states have call successors, (1385) [2025-01-09 03:56:00,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7523 states to 7523 states and 12964 transitions. [2025-01-09 03:56:00,927 INFO L78 Accepts]: Start accepts. Automaton has 7523 states and 12964 transitions. Word has length 158 [2025-01-09 03:56:00,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:00,928 INFO L471 AbstractCegarLoop]: Abstraction has 7523 states and 12964 transitions. [2025-01-09 03:56:00,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:56:00,928 INFO L276 IsEmpty]: Start isEmpty. Operand 7523 states and 12964 transitions. [2025-01-09 03:56:00,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-01-09 03:56:00,958 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:00,958 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:00,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:56:00,959 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:00,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:00,959 INFO L85 PathProgramCache]: Analyzing trace with hash 439287635, now seen corresponding path program 1 times [2025-01-09 03:56:00,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:00,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102910956] [2025-01-09 03:56:00,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:00,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:00,977 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-01-09 03:56:00,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-01-09 03:56:00,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:00,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:01,011 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 03:56:01,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:01,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102910956] [2025-01-09 03:56:01,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102910956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:01,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:01,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:01,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507939585] [2025-01-09 03:56:01,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:01,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:01,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:01,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:01,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:01,013 INFO L87 Difference]: Start difference. First operand 7523 states and 12964 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:56:01,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:01,250 INFO L93 Difference]: Finished difference Result 18955 states and 32873 transitions. [2025-01-09 03:56:01,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:01,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 178 [2025-01-09 03:56:01,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:01,379 INFO L225 Difference]: With dead ends: 18955 [2025-01-09 03:56:01,379 INFO L226 Difference]: Without dead ends: 12611 [2025-01-09 03:56:01,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:01,399 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 129 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1394 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:01,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1394 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:01,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12611 states. [2025-01-09 03:56:01,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12611 to 12603. [2025-01-09 03:56:01,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12603 states, 10479 states have (on average 1.658555205649394) internal successors, (17380), 10486 states have internal predecessors, (17380), 2090 states have call successors, (2090), 30 states have call predecessors, (2090), 33 states have return successors, (2285), 2088 states have call predecessors, (2285), 2089 states have call successors, (2285) [2025-01-09 03:56:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12603 states to 12603 states and 21755 transitions. [2025-01-09 03:56:01,891 INFO L78 Accepts]: Start accepts. Automaton has 12603 states and 21755 transitions. Word has length 178 [2025-01-09 03:56:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:01,892 INFO L471 AbstractCegarLoop]: Abstraction has 12603 states and 21755 transitions. [2025-01-09 03:56:01,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:56:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand 12603 states and 21755 transitions. [2025-01-09 03:56:01,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 03:56:01,943 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:01,944 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:01,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:56:01,944 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:01,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:01,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1884107190, now seen corresponding path program 1 times [2025-01-09 03:56:01,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:01,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524210307] [2025-01-09 03:56:01,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:01,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:01,967 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 03:56:01,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 03:56:01,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:01,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:02,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:02,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524210307] [2025-01-09 03:56:02,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524210307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:02,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:02,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:02,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700233575] [2025-01-09 03:56:02,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:02,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:02,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:02,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:02,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:02,025 INFO L87 Difference]: Start difference. First operand 12603 states and 21755 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:56:02,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:02,589 INFO L93 Difference]: Finished difference Result 30200 states and 52054 transitions. [2025-01-09 03:56:02,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:02,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 160 [2025-01-09 03:56:02,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:02,683 INFO L225 Difference]: With dead ends: 30200 [2025-01-09 03:56:02,684 INFO L226 Difference]: Without dead ends: 19758 [2025-01-09 03:56:02,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:02,734 INFO L435 NwaCegarLoop]: 704 mSDtfsCounter, 127 mSDsluCounter, 662 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1366 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:02,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1366 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:02,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19758 states. [2025-01-09 03:56:03,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19758 to 19750. [2025-01-09 03:56:03,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19750 states, 16423 states have (on average 1.6355111733544418) internal successors, (26860), 16430 states have internal predecessors, (26860), 3293 states have call successors, (3293), 30 states have call predecessors, (3293), 33 states have return successors, (3632), 3291 states have call predecessors, (3632), 3292 states have call successors, (3632) [2025-01-09 03:56:03,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19750 states to 19750 states and 33785 transitions. [2025-01-09 03:56:03,489 INFO L78 Accepts]: Start accepts. Automaton has 19750 states and 33785 transitions. Word has length 160 [2025-01-09 03:56:03,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:03,489 INFO L471 AbstractCegarLoop]: Abstraction has 19750 states and 33785 transitions. [2025-01-09 03:56:03,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:56:03,490 INFO L276 IsEmpty]: Start isEmpty. Operand 19750 states and 33785 transitions. [2025-01-09 03:56:03,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 03:56:03,536 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:03,536 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:03,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:56:03,536 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:03,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:03,536 INFO L85 PathProgramCache]: Analyzing trace with hash -1656654091, now seen corresponding path program 1 times [2025-01-09 03:56:03,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:03,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739406896] [2025-01-09 03:56:03,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:03,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:03,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 03:56:03,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 03:56:03,560 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:03,560 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:03,598 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-01-09 03:56:03,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:03,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739406896] [2025-01-09 03:56:03,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739406896] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:03,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:03,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:03,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872742805] [2025-01-09 03:56:03,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:03,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:03,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:03,601 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:03,601 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:03,601 INFO L87 Difference]: Start difference. First operand 19750 states and 33785 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:56:04,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:04,295 INFO L93 Difference]: Finished difference Result 52202 states and 89608 transitions. [2025-01-09 03:56:04,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:04,295 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 161 [2025-01-09 03:56:04,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:04,416 INFO L225 Difference]: With dead ends: 52202 [2025-01-09 03:56:04,416 INFO L226 Difference]: Without dead ends: 35261 [2025-01-09 03:56:04,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:04,452 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 125 mSDsluCounter, 689 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1384 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:04,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1384 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:04,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35261 states. [2025-01-09 03:56:05,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35261 to 35253. [2025-01-09 03:56:05,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35253 states, 29476 states have (on average 1.6324806622336816) internal successors, (48119), 29483 states have internal predecessors, (48119), 5743 states have call successors, (5743), 30 states have call predecessors, (5743), 33 states have return successors, (6356), 5741 states have call predecessors, (6356), 5742 states have call successors, (6356) [2025-01-09 03:56:05,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35253 states to 35253 states and 60218 transitions. [2025-01-09 03:56:05,716 INFO L78 Accepts]: Start accepts. Automaton has 35253 states and 60218 transitions. Word has length 161 [2025-01-09 03:56:05,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:05,716 INFO L471 AbstractCegarLoop]: Abstraction has 35253 states and 60218 transitions. [2025-01-09 03:56:05,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2025-01-09 03:56:05,716 INFO L276 IsEmpty]: Start isEmpty. Operand 35253 states and 60218 transitions. [2025-01-09 03:56:05,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2025-01-09 03:56:05,789 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:05,790 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:05,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:56:05,790 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:05,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:05,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1091961865, now seen corresponding path program 1 times [2025-01-09 03:56:05,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:05,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088891330] [2025-01-09 03:56:05,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:05,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:05,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 181 statements into 1 equivalence classes. [2025-01-09 03:56:05,822 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 181 of 181 statements. [2025-01-09 03:56:05,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:05,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:05,865 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 03:56:05,865 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:05,865 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088891330] [2025-01-09 03:56:05,865 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088891330] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:05,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:05,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:05,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337304737] [2025-01-09 03:56:05,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:05,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:05,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:05,867 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:05,867 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:05,867 INFO L87 Difference]: Start difference. First operand 35253 states and 60218 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:56:07,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:07,318 INFO L93 Difference]: Finished difference Result 96214 states and 164800 transitions. [2025-01-09 03:56:07,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:07,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 181 [2025-01-09 03:56:07,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:07,606 INFO L225 Difference]: With dead ends: 96214 [2025-01-09 03:56:07,606 INFO L226 Difference]: Without dead ends: 64689 [2025-01-09 03:56:07,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:07,704 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 123 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:07,704 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1392 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:07,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64689 states. [2025-01-09 03:56:10,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64689 to 64681. [2025-01-09 03:56:10,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64681 states, 54391 states have (on average 1.6282657057233734) internal successors, (88563), 54398 states have internal predecessors, (88563), 10256 states have call successors, (10256), 30 states have call predecessors, (10256), 33 states have return successors, (11401), 10254 states have call predecessors, (11401), 10255 states have call successors, (11401) [2025-01-09 03:56:10,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64681 states to 64681 states and 110220 transitions. [2025-01-09 03:56:10,477 INFO L78 Accepts]: Start accepts. Automaton has 64681 states and 110220 transitions. Word has length 181 [2025-01-09 03:56:10,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:10,477 INFO L471 AbstractCegarLoop]: Abstraction has 64681 states and 110220 transitions. [2025-01-09 03:56:10,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:56:10,478 INFO L276 IsEmpty]: Start isEmpty. Operand 64681 states and 110220 transitions. [2025-01-09 03:56:10,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-09 03:56:10,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:10,558 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:10,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:56:10,558 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:10,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:10,559 INFO L85 PathProgramCache]: Analyzing trace with hash -238428846, now seen corresponding path program 1 times [2025-01-09 03:56:10,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:10,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062333559] [2025-01-09 03:56:10,559 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:10,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:10,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-09 03:56:10,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-09 03:56:10,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:10,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:10,615 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 03:56:10,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:10,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062333559] [2025-01-09 03:56:10,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062333559] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:10,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:10,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:56:10,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578341675] [2025-01-09 03:56:10,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:10,616 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:56:10,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:10,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:56:10,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:10,617 INFO L87 Difference]: Start difference. First operand 64681 states and 110220 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:56:13,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:13,213 INFO L93 Difference]: Finished difference Result 121356 states and 207145 transitions. [2025-01-09 03:56:13,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:56:13,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 182 [2025-01-09 03:56:13,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:13,647 INFO L225 Difference]: With dead ends: 121356 [2025-01-09 03:56:13,647 INFO L226 Difference]: Without dead ends: 121089 [2025-01-09 03:56:13,704 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:56:13,705 INFO L435 NwaCegarLoop]: 697 mSDtfsCounter, 118 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:13,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1390 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:56:13,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121089 states. [2025-01-09 03:56:17,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121089 to 121081. [2025-01-09 03:56:17,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121081 states, 102423 states have (on average 1.6229460179842419) internal successors, (166227), 102430 states have internal predecessors, (166227), 18624 states have call successors, (18624), 30 states have call predecessors, (18624), 33 states have return successors, (20815), 18622 states have call predecessors, (20815), 18623 states have call successors, (20815) [2025-01-09 03:56:17,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121081 states to 121081 states and 205666 transitions. [2025-01-09 03:56:17,726 INFO L78 Accepts]: Start accepts. Automaton has 121081 states and 205666 transitions. Word has length 182 [2025-01-09 03:56:17,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:17,727 INFO L471 AbstractCegarLoop]: Abstraction has 121081 states and 205666 transitions. [2025-01-09 03:56:17,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:56:17,727 INFO L276 IsEmpty]: Start isEmpty. Operand 121081 states and 205666 transitions. [2025-01-09 03:56:17,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-01-09 03:56:17,824 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:17,824 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:17,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:56:17,824 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:17,825 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:17,825 INFO L85 PathProgramCache]: Analyzing trace with hash -961005640, now seen corresponding path program 1 times [2025-01-09 03:56:17,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:17,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328844496] [2025-01-09 03:56:17,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:17,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:17,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 183 statements into 1 equivalence classes. [2025-01-09 03:56:17,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 183 of 183 statements. [2025-01-09 03:56:17,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:17,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:17,945 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 03:56:17,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:17,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328844496] [2025-01-09 03:56:17,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328844496] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:17,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:17,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:56:17,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966055732] [2025-01-09 03:56:17,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:17,946 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:56:17,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:17,947 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:56:17,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:56:17,948 INFO L87 Difference]: Start difference. First operand 121081 states and 205666 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:56:22,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:56:22,710 INFO L93 Difference]: Finished difference Result 232907 states and 397123 transitions. [2025-01-09 03:56:22,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:56:22,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 183 [2025-01-09 03:56:22,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:56:23,704 INFO L225 Difference]: With dead ends: 232907 [2025-01-09 03:56:23,704 INFO L226 Difference]: Without dead ends: 232648 [2025-01-09 03:56:23,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:56:23,791 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 642 mSDsluCounter, 2756 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 3509 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 03:56:23,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 3509 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 03:56:23,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232648 states. [2025-01-09 03:56:29,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232648 to 232640. [2025-01-09 03:56:30,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232640 states, 196827 states have (on average 1.6258744989254523) internal successors, (320016), 196782 states have internal predecessors, (320016), 35750 states have call successors, (35750), 58 states have call predecessors, (35750), 62 states have return successors, (39033), 35803 states have call predecessors, (39033), 35748 states have call successors, (39033) [2025-01-09 03:56:30,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232640 states to 232640 states and 394799 transitions. [2025-01-09 03:56:30,836 INFO L78 Accepts]: Start accepts. Automaton has 232640 states and 394799 transitions. Word has length 183 [2025-01-09 03:56:30,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:56:30,837 INFO L471 AbstractCegarLoop]: Abstraction has 232640 states and 394799 transitions. [2025-01-09 03:56:30,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 5 states have internal predecessors, (113), 2 states have call successors, (24), 3 states have call predecessors, (24), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2025-01-09 03:56:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 232640 states and 394799 transitions. [2025-01-09 03:56:30,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-01-09 03:56:30,962 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:56:30,962 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:56:30,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:56:30,962 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:56:30,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:56:30,963 INFO L85 PathProgramCache]: Analyzing trace with hash 2121030923, now seen corresponding path program 1 times [2025-01-09 03:56:30,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:56:30,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1494728825] [2025-01-09 03:56:30,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:56:30,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:56:30,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-01-09 03:56:30,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-01-09 03:56:30,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:56:30,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:56:31,107 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-01-09 03:56:31,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:56:31,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1494728825] [2025-01-09 03:56:31,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1494728825] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:56:31,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:56:31,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 03:56:31,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732083583] [2025-01-09 03:56:31,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:56:31,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:56:31,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:56:31,108 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:56:31,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:56:31,109 INFO L87 Difference]: Start difference. First operand 232640 states and 394799 transitions. Second operand has 10 states, 9 states have (on average 12.666666666666666) internal successors, (114), 8 states have internal predecessors, (114), 5 states have call successors, (24), 4 states have call predecessors, (24), 2 states have return successors, (21), 4 states have call predecessors, (21), 5 states have call successors, (21)