./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product26.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_spec0_product26.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 2214b99fc6848bca0f24e9e72f44d1848092675b0f72a15c952711ed7656fcb1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:49:11,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:49:11,266 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:49:11,271 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:49:11,272 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:49:11,294 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:49:11,295 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:49:11,296 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:49:11,296 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:49:11,296 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:49:11,296 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:49:11,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:49:11,297 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:49:11,297 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:49:11,297 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:49:11,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:49:11,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:49:11,298 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:49:11,298 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:49:11,298 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:49:11,298 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:49:11,298 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:49:11,298 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:49:11,298 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:49:11,298 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:49:11,298 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:49:11,299 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:49:11,299 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:49:11,299 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:49:11,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:49:11,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:49:11,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:49:11,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:49:11,299 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:49:11,299 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:49:11,299 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:49:11,299 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:49:11,299 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:49:11,299 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:49:11,299 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:49:11,300 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:49:11,300 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:49:11,300 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:49:11,300 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:49:11,300 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:49:11,300 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:49:11,300 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:49:11,300 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:49:11,300 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 -> 2214b99fc6848bca0f24e9e72f44d1848092675b0f72a15c952711ed7656fcb1 [2025-01-09 03:49:11,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:49:11,595 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:49:11,598 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:49:11,599 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:49:11,599 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:49:11,600 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product26.cil.c [2025-01-09 03:49:12,876 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4bbdfc3d9/b6179f0edf034cba8c09854ec5cf6331/FLAG0c3b69856 [2025-01-09 03:49:13,222 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:49:13,222 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product26.cil.c [2025-01-09 03:49:13,239 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4bbdfc3d9/b6179f0edf034cba8c09854ec5cf6331/FLAG0c3b69856 [2025-01-09 03:49:13,252 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4bbdfc3d9/b6179f0edf034cba8c09854ec5cf6331 [2025-01-09 03:49:13,254 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:49:13,255 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:49:13,256 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:49:13,256 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:49:13,259 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:49:13,260 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:49:13" (1/1) ... [2025-01-09 03:49:13,260 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c579c03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:13, skipping insertion in model container [2025-01-09 03:49:13,261 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:49:13" (1/1) ... [2025-01-09 03:49:13,310 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:49:13,783 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_spec0_product26.cil.c[63882,63895] [2025-01-09 03:49:13,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:49:13,802 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:49:13,811 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [48] [2025-01-09 03:49:13,812 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [424] [2025-01-09 03:49:13,812 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [828] [2025-01-09 03:49:13,812 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1152] [2025-01-09 03:49:13,813 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1374] [2025-01-09 03:49:13,813 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1477] [2025-01-09 03:49:13,813 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1512] [2025-01-09 03:49:13,813 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [2572] [2025-01-09 03:49:13,814 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2592] [2025-01-09 03:49:13,815 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2958] [2025-01-09 03:49:13,815 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2975] [2025-01-09 03:49:13,926 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_spec0_product26.cil.c[63882,63895] [2025-01-09 03:49:13,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:49:13,961 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:49:13,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:13 WrapperNode [2025-01-09 03:49:13,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:49:13,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:49:13,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:49:13,965 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:49:13,969 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:49:13" (1/1) ... [2025-01-09 03:49:13,997 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:49:13" (1/1) ... [2025-01-09 03:49:14,053 INFO L138 Inliner]: procedures = 131, calls = 204, calls flagged for inlining = 59, calls inlined = 56, statements flattened = 1086 [2025-01-09 03:49:14,054 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:49:14,054 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:49:14,055 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:49:14,055 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:49:14,064 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:13" (1/1) ... [2025-01-09 03:49:14,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:13" (1/1) ... [2025-01-09 03:49:14,072 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:13" (1/1) ... [2025-01-09 03:49:14,106 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:49:14,106 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:13" (1/1) ... [2025-01-09 03:49:14,107 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:13" (1/1) ... [2025-01-09 03:49:14,129 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:13" (1/1) ... [2025-01-09 03:49:14,132 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:13" (1/1) ... [2025-01-09 03:49:14,150 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:13" (1/1) ... [2025-01-09 03:49:14,160 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:13" (1/1) ... [2025-01-09 03:49:14,173 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:13" (1/1) ... [2025-01-09 03:49:14,180 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:49:14,181 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:49:14,182 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:49:14,182 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:49:14,183 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:13" (1/1) ... [2025-01-09 03:49:14,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:49:14,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:14,220 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:49:14,225 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:49:14,253 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-01-09 03:49:14,254 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-01-09 03:49:14,254 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:49:14,254 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:49:14,255 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-01-09 03:49:14,255 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-01-09 03:49:14,255 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:49:14,255 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:49:14,255 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:49:14,255 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:49:14,256 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-01-09 03:49:14,256 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-01-09 03:49:14,256 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:49:14,256 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:49:14,256 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:49:14,256 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:49:14,256 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:49:14,257 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:49:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:49:14,257 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:49:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:49:14,257 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:49:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:49:14,257 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:49:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-01-09 03:49:14,257 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-01-09 03:49:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:49:14,257 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:49:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:49:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-01-09 03:49:14,257 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-01-09 03:49:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:49:14,257 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:49:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:49:14,257 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:49:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:49:14,257 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:49:14,257 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:49:14,258 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:49:14,258 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:49:14,258 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:49:14,258 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:49:14,258 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:49:14,258 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:49:14,258 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:49:14,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:49:14,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:49:14,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:49:14,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:49:14,258 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:49:14,258 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:49:14,258 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-01-09 03:49:14,258 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-01-09 03:49:14,258 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:49:14,258 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:49:14,481 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:49:14,484 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:49:15,539 INFO L? ?]: Removed 537 outVars from TransFormulas that were not future-live. [2025-01-09 03:49:15,540 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:49:15,561 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:49:15,561 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:49:15,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:49:15 BoogieIcfgContainer [2025-01-09 03:49:15,565 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:49:15,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:49:15,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:49:15,571 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:49:15,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:49:13" (1/3) ... [2025-01-09 03:49:15,572 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a17bde9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:49:15, skipping insertion in model container [2025-01-09 03:49:15,572 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:13" (2/3) ... [2025-01-09 03:49:15,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a17bde9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:49:15, skipping insertion in model container [2025-01-09 03:49:15,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:49:15" (3/3) ... [2025-01-09 03:49:15,575 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_product26.cil.c [2025-01-09 03:49:15,588 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:49:15,591 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_product26.cil.c that has 25 procedures, 399 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:49:15,661 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:49:15,672 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;@1b193c8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:49:15,672 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:49:15,680 INFO L276 IsEmpty]: Start isEmpty. Operand has 399 states, 311 states have (on average 1.5594855305466238) internal successors, (485), 316 states have internal predecessors, (485), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) [2025-01-09 03:49:15,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 03:49:15,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:15,706 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] [2025-01-09 03:49:15,706 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:15,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:15,712 INFO L85 PathProgramCache]: Analyzing trace with hash -80421356, now seen corresponding path program 1 times [2025-01-09 03:49:15,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:15,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1367911687] [2025-01-09 03:49:15,719 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:15,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:15,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 03:49:15,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 03:49:15,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:15,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:16,497 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:49:16,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:16,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1367911687] [2025-01-09 03:49:16,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1367911687] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:16,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127745268] [2025-01-09 03:49:16,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:16,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:16,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:16,501 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:49:16,504 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:49:16,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 03:49:16,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 03:49:16,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:16,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:16,909 INFO L256 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 03:49:16,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:16,953 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:49:16,954 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:49:16,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127745268] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:16,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:49:16,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-01-09 03:49:16,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282848664] [2025-01-09 03:49:16,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:16,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:49:16,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:16,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:49:16,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:49:16,987 INFO L87 Difference]: Start difference. First operand has 399 states, 311 states have (on average 1.5594855305466238) internal successors, (485), 316 states have internal predecessors, (485), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (62), 61 states have call predecessors, (62), 62 states have call successors, (62) Second operand has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:49:17,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:17,062 INFO L93 Difference]: Finished difference Result 601 states and 902 transitions. [2025-01-09 03:49:17,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:49:17,066 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2025-01-09 03:49:17,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:17,080 INFO L225 Difference]: With dead ends: 601 [2025-01-09 03:49:17,080 INFO L226 Difference]: Without dead ends: 392 [2025-01-09 03:49:17,087 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 129 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:49:17,091 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:17,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-01-09 03:49:17,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 392. [2025-01-09 03:49:17,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 305 states have (on average 1.5573770491803278) internal successors, (475), 309 states have internal predecessors, (475), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 03:49:17,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 598 transitions. [2025-01-09 03:49:17,157 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 598 transitions. Word has length 128 [2025-01-09 03:49:17,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:17,158 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 598 transitions. [2025-01-09 03:49:17,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 37.0) internal successors, (74), 2 states have internal predecessors, (74), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:49:17,159 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 598 transitions. [2025-01-09 03:49:17,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 03:49:17,166 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:17,166 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] [2025-01-09 03:49:17,178 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:49:17,367 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:49:17,367 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:17,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:17,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1204609950, now seen corresponding path program 1 times [2025-01-09 03:49:17,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:17,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547503143] [2025-01-09 03:49:17,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:17,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:17,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 03:49:17,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 03:49:17,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:17,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:17,737 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:49:17,737 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:17,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547503143] [2025-01-09 03:49:17,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547503143] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:17,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2143945619] [2025-01-09 03:49:17,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:17,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:17,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:17,742 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:49:17,744 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:49:17,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 03:49:18,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 03:49:18,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:18,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:18,124 INFO L256 TraceCheckSpWp]: Trace formula consists of 1130 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:49:18,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:18,167 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:49:18,167 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:49:18,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2143945619] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:18,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:49:18,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:49:18,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237178556] [2025-01-09 03:49:18,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:18,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:18,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:18,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:18,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:49:18,170 INFO L87 Difference]: Start difference. First operand 392 states and 598 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:49:18,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:18,233 INFO L93 Difference]: Finished difference Result 590 states and 880 transitions. [2025-01-09 03:49:18,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:18,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 128 [2025-01-09 03:49:18,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:18,241 INFO L225 Difference]: With dead ends: 590 [2025-01-09 03:49:18,244 INFO L226 Difference]: Without dead ends: 394 [2025-01-09 03:49:18,246 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 128 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:49:18,247 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 1 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1190 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:18,247 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1190 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:18,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-01-09 03:49:18,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 393. [2025-01-09 03:49:18,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 306 states have (on average 1.5555555555555556) internal successors, (476), 310 states have internal predecessors, (476), 62 states have call successors, (62), 24 states have call predecessors, (62), 24 states have return successors, (61), 60 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 03:49:18,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 599 transitions. [2025-01-09 03:49:18,291 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 599 transitions. Word has length 128 [2025-01-09 03:49:18,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:18,292 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 599 transitions. [2025-01-09 03:49:18,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:49:18,293 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 599 transitions. [2025-01-09 03:49:18,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 03:49:18,298 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:18,298 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] [2025-01-09 03:49:18,308 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:49:18,503 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:49:18,503 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:18,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:18,504 INFO L85 PathProgramCache]: Analyzing trace with hash -2111096335, now seen corresponding path program 1 times [2025-01-09 03:49:18,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:18,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239883086] [2025-01-09 03:49:18,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:18,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:18,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 03:49:18,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 03:49:18,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:18,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:18,814 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:49:18,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:18,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239883086] [2025-01-09 03:49:18,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239883086] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:18,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1324481582] [2025-01-09 03:49:18,814 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:18,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:18,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:18,818 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:49:18,820 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:49:19,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 03:49:19,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 03:49:19,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:19,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:19,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 1154 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:49:19,168 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:19,190 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:49:19,190 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:49:19,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1324481582] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:19,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:49:19,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:49:19,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603394896] [2025-01-09 03:49:19,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:19,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:19,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:19,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:19,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:49:19,192 INFO L87 Difference]: Start difference. First operand 393 states and 599 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:49:19,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:19,237 INFO L93 Difference]: Finished difference Result 839 states and 1298 transitions. [2025-01-09 03:49:19,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:19,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 136 [2025-01-09 03:49:19,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:19,241 INFO L225 Difference]: With dead ends: 839 [2025-01-09 03:49:19,242 INFO L226 Difference]: Without dead ends: 472 [2025-01-09 03:49:19,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 136 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:49:19,244 INFO L435 NwaCegarLoop]: 614 mSDtfsCounter, 142 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1166 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:49:19,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1166 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:19,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-01-09 03:49:19,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 464. [2025-01-09 03:49:19,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 363 states have (on average 1.5757575757575757) internal successors, (572), 367 states have internal predecessors, (572), 76 states have call successors, (76), 24 states have call predecessors, (76), 24 states have return successors, (75), 74 states have call predecessors, (75), 75 states have call successors, (75) [2025-01-09 03:49:19,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 723 transitions. [2025-01-09 03:49:19,269 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 723 transitions. Word has length 136 [2025-01-09 03:49:19,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:19,269 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 723 transitions. [2025-01-09 03:49:19,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:49:19,269 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 723 transitions. [2025-01-09 03:49:19,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 03:49:19,276 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:19,276 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] [2025-01-09 03:49:19,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:49:19,477 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:49:19,477 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:19,478 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:19,478 INFO L85 PathProgramCache]: Analyzing trace with hash 519042787, now seen corresponding path program 1 times [2025-01-09 03:49:19,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:19,478 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751026072] [2025-01-09 03:49:19,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:19,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:19,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 03:49:19,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 03:49:19,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:19,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:19,691 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:49:19,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:19,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751026072] [2025-01-09 03:49:19,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751026072] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:19,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435133611] [2025-01-09 03:49:19,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:19,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:19,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:19,695 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:49:19,696 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:49:19,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 03:49:20,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 03:49:20,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:20,002 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:20,010 INFO L256 TraceCheckSpWp]: Trace formula consists of 1159 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:49:20,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:20,078 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:49:20,078 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:49:20,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435133611] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:20,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:49:20,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:49:20,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283096502] [2025-01-09 03:49:20,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:20,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:49:20,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:20,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:49:20,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:49:20,080 INFO L87 Difference]: Start difference. First operand 464 states and 723 transitions. Second operand has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:49:20,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:20,190 INFO L93 Difference]: Finished difference Result 919 states and 1436 transitions. [2025-01-09 03:49:20,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:49:20,192 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 137 [2025-01-09 03:49:20,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:20,198 INFO L225 Difference]: With dead ends: 919 [2025-01-09 03:49:20,198 INFO L226 Difference]: Without dead ends: 466 [2025-01-09 03:49:20,200 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 135 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:49:20,202 INFO L435 NwaCegarLoop]: 590 mSDtfsCounter, 2 mSDsluCounter, 1759 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2349 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:20,202 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2349 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:49:20,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2025-01-09 03:49:20,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2025-01-09 03:49:20,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 364 states have (on average 1.5741758241758241) internal successors, (573), 369 states have internal predecessors, (573), 76 states have call successors, (76), 24 states have call predecessors, (76), 25 states have return successors, (77), 74 states have call predecessors, (77), 75 states have call successors, (77) [2025-01-09 03:49:20,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 726 transitions. [2025-01-09 03:49:20,227 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 726 transitions. Word has length 137 [2025-01-09 03:49:20,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:20,228 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 726 transitions. [2025-01-09 03:49:20,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.0) internal successors, (92), 5 states have internal predecessors, (92), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:49:20,228 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 726 transitions. [2025-01-09 03:49:20,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-01-09 03:49:20,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:20,231 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:49:20,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 03:49:20,435 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:49:20,435 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:20,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:20,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1308631311, now seen corresponding path program 1 times [2025-01-09 03:49:20,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:20,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178697432] [2025-01-09 03:49:20,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:20,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:20,464 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 03:49:20,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 03:49:20,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:20,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:49:20,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:20,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178697432] [2025-01-09 03:49:20,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178697432] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:20,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124132850] [2025-01-09 03:49:20,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:20,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:20,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:20,661 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:49:20,662 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:49:20,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-01-09 03:49:21,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-01-09 03:49:21,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:21,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:21,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 1238 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:49:21,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:21,112 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:49:21,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:49:21,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124132850] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:21,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:49:21,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:49:21,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329776959] [2025-01-09 03:49:21,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:21,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:49:21,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:21,116 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:49:21,116 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:49:21,116 INFO L87 Difference]: Start difference. First operand 466 states and 726 transitions. Second operand has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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:49:21,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:21,207 INFO L93 Difference]: Finished difference Result 921 states and 1441 transitions. [2025-01-09 03:49:21,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:49:21,209 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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 157 [2025-01-09 03:49:21,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:21,212 INFO L225 Difference]: With dead ends: 921 [2025-01-09 03:49:21,214 INFO L226 Difference]: Without dead ends: 468 [2025-01-09 03:49:21,216 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 155 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:49:21,217 INFO L435 NwaCegarLoop]: 588 mSDtfsCounter, 2 mSDsluCounter, 1747 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2335 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:49:21,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2335 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:21,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-01-09 03:49:21,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-01-09 03:49:21,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 365 states have (on average 1.5726027397260274) internal successors, (574), 371 states have internal predecessors, (574), 76 states have call successors, (76), 24 states have call predecessors, (76), 26 states have return successors, (82), 74 states have call predecessors, (82), 75 states have call successors, (82) [2025-01-09 03:49:21,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 732 transitions. [2025-01-09 03:49:21,248 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 732 transitions. Word has length 157 [2025-01-09 03:49:21,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:21,248 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 732 transitions. [2025-01-09 03:49:21,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.2) internal successors, (101), 5 states have internal predecessors, (101), 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:49:21,249 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 732 transitions. [2025-01-09 03:49:21,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-01-09 03:49:21,255 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:21,255 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] [2025-01-09 03:49:21,266 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 03:49:21,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:21,460 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:21,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:21,461 INFO L85 PathProgramCache]: Analyzing trace with hash 1869194449, now seen corresponding path program 1 times [2025-01-09 03:49:21,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:21,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739570430] [2025-01-09 03:49:21,461 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:21,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:21,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-01-09 03:49:21,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-01-09 03:49:21,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:21,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:21,656 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 03:49:21,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:21,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739570430] [2025-01-09 03:49:21,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739570430] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:21,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:21,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:49:21,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324035186] [2025-01-09 03:49:21,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:21,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:49:21,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:21,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:49:21,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:49:21,659 INFO L87 Difference]: Start difference. First operand 468 states and 732 transitions. Second operand has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:49:21,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:21,734 INFO L93 Difference]: Finished difference Result 913 states and 1432 transitions. [2025-01-09 03:49:21,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:49:21,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 139 [2025-01-09 03:49:21,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:21,738 INFO L225 Difference]: With dead ends: 913 [2025-01-09 03:49:21,738 INFO L226 Difference]: Without dead ends: 468 [2025-01-09 03:49:21,742 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:49:21,743 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 2 mSDsluCounter, 1762 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2353 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:49:21,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2353 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:21,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2025-01-09 03:49:21,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 468. [2025-01-09 03:49:21,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 365 states have (on average 1.5726027397260274) internal successors, (574), 371 states have internal predecessors, (574), 76 states have call successors, (76), 24 states have call predecessors, (76), 26 states have return successors, (81), 74 states have call predecessors, (81), 75 states have call successors, (81) [2025-01-09 03:49:21,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 731 transitions. [2025-01-09 03:49:21,773 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 731 transitions. Word has length 139 [2025-01-09 03:49:21,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:21,774 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 731 transitions. [2025-01-09 03:49:21,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.5) internal successors, (90), 5 states have internal predecessors, (90), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2025-01-09 03:49:21,774 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 731 transitions. [2025-01-09 03:49:21,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 03:49:21,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:21,777 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:21,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:49:21,778 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:21,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:21,782 INFO L85 PathProgramCache]: Analyzing trace with hash -775651739, now seen corresponding path program 1 times [2025-01-09 03:49:21,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:21,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1695973409] [2025-01-09 03:49:21,782 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:21,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:21,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 03:49:21,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 03:49:21,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:21,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:21,970 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-01-09 03:49:21,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:21,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1695973409] [2025-01-09 03:49:21,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1695973409] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:21,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:21,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:49:21,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201881533] [2025-01-09 03:49:21,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:21,972 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:49:21,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:21,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:49:21,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:49:21,973 INFO L87 Difference]: Start difference. First operand 468 states and 731 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, (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:49:22,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:22,030 INFO L93 Difference]: Finished difference Result 915 states and 1435 transitions. [2025-01-09 03:49:22,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:49:22,030 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, (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 159 [2025-01-09 03:49:22,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:22,035 INFO L225 Difference]: With dead ends: 915 [2025-01-09 03:49:22,035 INFO L226 Difference]: Without dead ends: 470 [2025-01-09 03:49:22,036 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:49:22,037 INFO L435 NwaCegarLoop]: 592 mSDtfsCounter, 1 mSDsluCounter, 1764 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2356 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:49:22,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2356 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:22,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2025-01-09 03:49:22,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 470. [2025-01-09 03:49:22,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 366 states have (on average 1.5710382513661203) internal successors, (575), 373 states have internal predecessors, (575), 76 states have call successors, (76), 24 states have call predecessors, (76), 27 states have return successors, (83), 74 states have call predecessors, (83), 75 states have call successors, (83) [2025-01-09 03:49:22,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 734 transitions. [2025-01-09 03:49:22,062 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 734 transitions. Word has length 159 [2025-01-09 03:49:22,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:22,062 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 734 transitions. [2025-01-09 03:49:22,063 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, (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:49:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 734 transitions. [2025-01-09 03:49:22,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 03:49:22,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:22,067 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:22,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:49:22,067 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:22,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:22,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2099439654, now seen corresponding path program 1 times [2025-01-09 03:49:22,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:22,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652316211] [2025-01-09 03:49:22,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:22,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:22,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 03:49:22,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 03:49:22,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:22,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:22,268 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2025-01-09 03:49:22,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:22,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652316211] [2025-01-09 03:49:22,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652316211] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:22,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:22,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:49:22,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71195994] [2025-01-09 03:49:22,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:22,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:49:22,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:22,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:49:22,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:49:22,270 INFO L87 Difference]: Start difference. First operand 470 states and 734 transitions. Second operand has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-01-09 03:49:22,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:22,413 INFO L93 Difference]: Finished difference Result 917 states and 1434 transitions. [2025-01-09 03:49:22,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:49:22,414 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) Word has length 160 [2025-01-09 03:49:22,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:22,418 INFO L225 Difference]: With dead ends: 917 [2025-01-09 03:49:22,418 INFO L226 Difference]: Without dead ends: 472 [2025-01-09 03:49:22,420 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:49:22,421 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 7 mSDsluCounter, 3463 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4045 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:22,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4045 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:49:22,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-01-09 03:49:22,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2025-01-09 03:49:22,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 368 states have (on average 1.5679347826086956) internal successors, (577), 374 states have internal predecessors, (577), 76 states have call successors, (76), 25 states have call predecessors, (76), 27 states have return successors, (82), 74 states have call predecessors, (82), 75 states have call successors, (82) [2025-01-09 03:49:22,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 735 transitions. [2025-01-09 03:49:22,442 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 735 transitions. Word has length 160 [2025-01-09 03:49:22,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:22,443 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 735 transitions. [2025-01-09 03:49:22,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.571428571428571) internal successors, (102), 8 states have internal predecessors, (102), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (18), 3 states have call predecessors, (18), 4 states have call successors, (18) [2025-01-09 03:49:22,443 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 735 transitions. [2025-01-09 03:49:22,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 03:49:22,446 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:22,447 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] [2025-01-09 03:49:22,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:49:22,447 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:22,447 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:22,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1294729668, now seen corresponding path program 1 times [2025-01-09 03:49:22,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:22,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1883323569] [2025-01-09 03:49:22,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:22,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:22,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 03:49:22,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 03:49:22,481 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:22,481 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:22,656 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 03:49:22,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:22,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1883323569] [2025-01-09 03:49:22,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1883323569] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:22,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:22,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:49:22,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755616010] [2025-01-09 03:49:22,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:22,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:49:22,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:22,658 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:49:22,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:49:22,658 INFO L87 Difference]: Start difference. First operand 472 states and 735 transitions. Second operand has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 03:49:22,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:22,804 INFO L93 Difference]: Finished difference Result 920 states and 1441 transitions. [2025-01-09 03:49:22,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:49:22,805 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 142 [2025-01-09 03:49:22,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:22,809 INFO L225 Difference]: With dead ends: 920 [2025-01-09 03:49:22,809 INFO L226 Difference]: Without dead ends: 475 [2025-01-09 03:49:22,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:49:22,811 INFO L435 NwaCegarLoop]: 584 mSDtfsCounter, 5 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4059 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:22,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4059 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:49:22,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2025-01-09 03:49:22,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 475. [2025-01-09 03:49:22,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 370 states have (on average 1.5648648648648649) internal successors, (579), 377 states have internal predecessors, (579), 76 states have call successors, (76), 25 states have call predecessors, (76), 28 states have return successors, (87), 74 states have call predecessors, (87), 75 states have call successors, (87) [2025-01-09 03:49:22,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 742 transitions. [2025-01-09 03:49:22,831 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 742 transitions. Word has length 142 [2025-01-09 03:49:22,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:22,831 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 742 transitions. [2025-01-09 03:49:22,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.714285714285714) internal successors, (96), 8 states have internal predecessors, (96), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2025-01-09 03:49:22,831 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 742 transitions. [2025-01-09 03:49:22,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 03:49:22,834 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:22,834 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:22,834 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:49:22,834 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:22,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:22,835 INFO L85 PathProgramCache]: Analyzing trace with hash -1796432767, now seen corresponding path program 1 times [2025-01-09 03:49:22,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:22,835 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308045818] [2025-01-09 03:49:22,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:22,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:22,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 03:49:22,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 03:49:22,867 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:22,867 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:23,043 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-01-09 03:49:23,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:23,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308045818] [2025-01-09 03:49:23,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308045818] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:23,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [437612681] [2025-01-09 03:49:23,044 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:23,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:23,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:23,046 INFO L229 MonitoredProcess]: Starting monitored process 7 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:49:23,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:49:23,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 03:49:23,430 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 03:49:23,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:23,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:23,436 INFO L256 TraceCheckSpWp]: Trace formula consists of 1243 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:49:23,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:23,487 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-09 03:49:23,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:49:23,614 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-09 03:49:23,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [437612681] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:49:23,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:49:23,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-01-09 03:49:23,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302536474] [2025-01-09 03:49:23,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:49:23,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:49:23,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:23,616 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:49:23,616 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:49:23,616 INFO L87 Difference]: Start difference. First operand 475 states and 742 transitions. Second operand has 11 states, 10 states have (on average 15.2) internal successors, (152), 11 states have internal predecessors, (152), 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:49:24,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:24,334 INFO L93 Difference]: Finished difference Result 1382 states and 2251 transitions. [2025-01-09 03:49:24,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:49:24,335 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 15.2) internal successors, (152), 11 states have internal predecessors, (152), 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 162 [2025-01-09 03:49:24,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:24,341 INFO L225 Difference]: With dead ends: 1382 [2025-01-09 03:49:24,341 INFO L226 Difference]: Without dead ends: 938 [2025-01-09 03:49:24,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-01-09 03:49:24,343 INFO L435 NwaCegarLoop]: 585 mSDtfsCounter, 1547 mSDsluCounter, 3181 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1547 SdHoareTripleChecker+Valid, 3766 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:24,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1547 Valid, 3766 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 03:49:24,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 938 states. [2025-01-09 03:49:24,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 938 to 914. [2025-01-09 03:49:24,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 914 states, 730 states have (on average 1.6178082191780823) internal successors, (1181), 736 states have internal predecessors, (1181), 155 states have call successors, (155), 26 states have call predecessors, (155), 28 states have return successors, (176), 153 states have call predecessors, (176), 154 states have call successors, (176) [2025-01-09 03:49:24,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 914 states to 914 states and 1512 transitions. [2025-01-09 03:49:24,391 INFO L78 Accepts]: Start accepts. Automaton has 914 states and 1512 transitions. Word has length 162 [2025-01-09 03:49:24,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:24,392 INFO L471 AbstractCegarLoop]: Abstraction has 914 states and 1512 transitions. [2025-01-09 03:49:24,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 15.2) internal successors, (152), 11 states have internal predecessors, (152), 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:49:24,392 INFO L276 IsEmpty]: Start isEmpty. Operand 914 states and 1512 transitions. [2025-01-09 03:49:24,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 03:49:24,418 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:24,418 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:24,428 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 03:49:24,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 03:49:24,619 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:24,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:24,620 INFO L85 PathProgramCache]: Analyzing trace with hash -1598079846, now seen corresponding path program 1 times [2025-01-09 03:49:24,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:24,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441798813] [2025-01-09 03:49:24,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:24,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:24,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 03:49:24,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 03:49:24,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:24,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:24,708 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-09 03:49:24,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:24,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441798813] [2025-01-09 03:49:24,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441798813] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:24,709 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:24,709 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:24,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431969020] [2025-01-09 03:49:24,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:24,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:24,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:24,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:24,710 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:24,710 INFO L87 Difference]: Start difference. First operand 914 states and 1512 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:49:24,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:24,760 INFO L93 Difference]: Finished difference Result 2163 states and 3637 transitions. [2025-01-09 03:49:24,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:24,761 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 166 [2025-01-09 03:49:24,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:24,769 INFO L225 Difference]: With dead ends: 2163 [2025-01-09 03:49:24,769 INFO L226 Difference]: Without dead ends: 1330 [2025-01-09 03:49:24,772 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:49:24,773 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 139 mSDsluCounter, 586 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1194 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:49:24,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1194 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:24,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2025-01-09 03:49:24,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1322. [2025-01-09 03:49:24,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 1059 states have (on average 1.6373937677053825) internal successors, (1734), 1065 states have internal predecessors, (1734), 234 states have call successors, (234), 26 states have call predecessors, (234), 28 states have return successors, (265), 232 states have call predecessors, (265), 233 states have call successors, (265) [2025-01-09 03:49:24,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 2233 transitions. [2025-01-09 03:49:24,832 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 2233 transitions. Word has length 166 [2025-01-09 03:49:24,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:24,832 INFO L471 AbstractCegarLoop]: Abstraction has 1322 states and 2233 transitions. [2025-01-09 03:49:24,833 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:49:24,833 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 2233 transitions. [2025-01-09 03:49:24,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 03:49:24,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:24,840 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:24,841 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:49:24,841 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:24,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:24,841 INFO L85 PathProgramCache]: Analyzing trace with hash -442690305, now seen corresponding path program 1 times [2025-01-09 03:49:24,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:24,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180915313] [2025-01-09 03:49:24,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:24,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:24,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 03:49:24,869 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 03:49:24,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:24,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:24,909 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-09 03:49:24,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:24,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180915313] [2025-01-09 03:49:24,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180915313] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:24,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:24,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:24,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120609436] [2025-01-09 03:49:24,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:24,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:24,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:24,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:24,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:24,911 INFO L87 Difference]: Start difference. First operand 1322 states and 2233 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:49:24,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:24,982 INFO L93 Difference]: Finished difference Result 3185 states and 5417 transitions. [2025-01-09 03:49:24,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:24,982 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 167 [2025-01-09 03:49:24,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:24,995 INFO L225 Difference]: With dead ends: 3185 [2025-01-09 03:49:24,995 INFO L226 Difference]: Without dead ends: 1995 [2025-01-09 03:49:25,000 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:49:25,000 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 137 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1188 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:49:25,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1188 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:25,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1995 states. [2025-01-09 03:49:25,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1995 to 1987. [2025-01-09 03:49:25,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1987 states, 1605 states have (on average 1.6473520249221183) internal successors, (2644), 1611 states have internal predecessors, (2644), 353 states have call successors, (353), 26 states have call predecessors, (353), 28 states have return successors, (384), 351 states have call predecessors, (384), 352 states have call successors, (384) [2025-01-09 03:49:25,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1987 states to 1987 states and 3381 transitions. [2025-01-09 03:49:25,125 INFO L78 Accepts]: Start accepts. Automaton has 1987 states and 3381 transitions. Word has length 167 [2025-01-09 03:49:25,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:25,125 INFO L471 AbstractCegarLoop]: Abstraction has 1987 states and 3381 transitions. [2025-01-09 03:49:25,125 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:49:25,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1987 states and 3381 transitions. [2025-01-09 03:49:25,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 03:49:25,138 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:25,138 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] [2025-01-09 03:49:25,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:49:25,138 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:25,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:25,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2093996788, now seen corresponding path program 1 times [2025-01-09 03:49:25,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:25,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551614032] [2025-01-09 03:49:25,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:25,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:25,164 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 03:49:25,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 03:49:25,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:25,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:25,208 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:49:25,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:25,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551614032] [2025-01-09 03:49:25,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551614032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:25,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:25,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:25,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689866530] [2025-01-09 03:49:25,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:25,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:25,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:25,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:25,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:25,209 INFO L87 Difference]: Start difference. First operand 1987 states and 3381 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:49:25,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:25,303 INFO L93 Difference]: Finished difference Result 4742 states and 8134 transitions. [2025-01-09 03:49:25,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:25,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 149 [2025-01-09 03:49:25,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:25,322 INFO L225 Difference]: With dead ends: 4742 [2025-01-09 03:49:25,322 INFO L226 Difference]: Without dead ends: 3018 [2025-01-09 03:49:25,328 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:49:25,329 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 135 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1183 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:49:25,329 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1183 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:25,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3018 states. [2025-01-09 03:49:25,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3018 to 3010. [2025-01-09 03:49:25,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3010 states, 2466 states have (on average 1.6553122465531225) internal successors, (4082), 2472 states have internal predecessors, (4082), 515 states have call successors, (515), 26 states have call predecessors, (515), 28 states have return successors, (562), 513 states have call predecessors, (562), 514 states have call successors, (562) [2025-01-09 03:49:25,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3010 states to 3010 states and 5159 transitions. [2025-01-09 03:49:25,498 INFO L78 Accepts]: Start accepts. Automaton has 3010 states and 5159 transitions. Word has length 149 [2025-01-09 03:49:25,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:25,499 INFO L471 AbstractCegarLoop]: Abstraction has 3010 states and 5159 transitions. [2025-01-09 03:49:25,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:49:25,500 INFO L276 IsEmpty]: Start isEmpty. Operand 3010 states and 5159 transitions. [2025-01-09 03:49:25,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-09 03:49:25,519 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:25,519 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:25,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:49:25,519 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:25,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:25,519 INFO L85 PathProgramCache]: Analyzing trace with hash 43460224, now seen corresponding path program 1 times [2025-01-09 03:49:25,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:25,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139835891] [2025-01-09 03:49:25,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:25,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:25,540 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-09 03:49:25,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-09 03:49:25,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:25,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:25,592 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-09 03:49:25,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:25,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139835891] [2025-01-09 03:49:25,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139835891] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:25,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:25,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:25,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987315029] [2025-01-09 03:49:25,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:25,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:25,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:25,594 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:25,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:25,595 INFO L87 Difference]: Start difference. First operand 3010 states and 5159 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:49:25,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:25,736 INFO L93 Difference]: Finished difference Result 7210 states and 12446 transitions. [2025-01-09 03:49:25,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:25,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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 169 [2025-01-09 03:49:25,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:25,771 INFO L225 Difference]: With dead ends: 7210 [2025-01-09 03:49:25,771 INFO L226 Difference]: Without dead ends: 4675 [2025-01-09 03:49:25,783 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:49:25,784 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 133 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1183 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:49:25,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1183 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:25,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4675 states. [2025-01-09 03:49:26,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4675 to 4667. [2025-01-09 03:49:26,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4667 states, 3878 states have (on average 1.6609076843733883) internal successors, (6441), 3884 states have internal predecessors, (6441), 760 states have call successors, (760), 26 states have call predecessors, (760), 28 states have return successors, (833), 758 states have call predecessors, (833), 759 states have call successors, (833) [2025-01-09 03:49:26,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4667 states to 4667 states and 8034 transitions. [2025-01-09 03:49:26,069 INFO L78 Accepts]: Start accepts. Automaton has 4667 states and 8034 transitions. Word has length 169 [2025-01-09 03:49:26,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:26,069 INFO L471 AbstractCegarLoop]: Abstraction has 4667 states and 8034 transitions. [2025-01-09 03:49:26,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 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:49:26,070 INFO L276 IsEmpty]: Start isEmpty. Operand 4667 states and 8034 transitions. [2025-01-09 03:49:26,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 03:49:26,095 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:26,095 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] [2025-01-09 03:49:26,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:49:26,096 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:26,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:26,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1693150296, now seen corresponding path program 1 times [2025-01-09 03:49:26,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:26,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555684498] [2025-01-09 03:49:26,096 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:26,096 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:26,117 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 03:49:26,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 03:49:26,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:26,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:26,161 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:49:26,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:26,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555684498] [2025-01-09 03:49:26,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555684498] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:26,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:26,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:26,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076521709] [2025-01-09 03:49:26,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:26,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:26,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:26,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:26,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:26,162 INFO L87 Difference]: Start difference. First operand 4667 states and 8034 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:49:26,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:26,470 INFO L93 Difference]: Finished difference Result 11334 states and 19646 transitions. [2025-01-09 03:49:26,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:26,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 151 [2025-01-09 03:49:26,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:26,526 INFO L225 Difference]: With dead ends: 11334 [2025-01-09 03:49:26,526 INFO L226 Difference]: Without dead ends: 7463 [2025-01-09 03:49:26,547 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:49:26,548 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 131 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1195 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:49:26,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1195 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:26,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7463 states. [2025-01-09 03:49:26,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7463 to 7455. [2025-01-09 03:49:26,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7455 states, 6173 states have (on average 1.6596468491819212) internal successors, (10245), 6179 states have internal predecessors, (10245), 1253 states have call successors, (1253), 26 states have call predecessors, (1253), 28 states have return successors, (1370), 1251 states have call predecessors, (1370), 1252 states have call successors, (1370) [2025-01-09 03:49:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7455 states to 7455 states and 12868 transitions. [2025-01-09 03:49:27,022 INFO L78 Accepts]: Start accepts. Automaton has 7455 states and 12868 transitions. Word has length 151 [2025-01-09 03:49:27,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:27,022 INFO L471 AbstractCegarLoop]: Abstraction has 7455 states and 12868 transitions. [2025-01-09 03:49:27,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:49:27,022 INFO L276 IsEmpty]: Start isEmpty. Operand 7455 states and 12868 transitions. [2025-01-09 03:49:27,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 03:49:27,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:27,059 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:27,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:49:27,059 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:27,060 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:27,060 INFO L85 PathProgramCache]: Analyzing trace with hash 2054294116, now seen corresponding path program 1 times [2025-01-09 03:49:27,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:27,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595679900] [2025-01-09 03:49:27,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:27,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:27,081 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 03:49:27,090 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 03:49:27,090 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:27,090 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:27,129 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-09 03:49:27,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:27,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595679900] [2025-01-09 03:49:27,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595679900] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:27,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:27,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:27,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090882678] [2025-01-09 03:49:27,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:27,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:27,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:27,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:27,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:27,131 INFO L87 Difference]: Start difference. First operand 7455 states and 12868 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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:49:27,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:27,479 INFO L93 Difference]: Finished difference Result 18816 states and 32678 transitions. [2025-01-09 03:49:27,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:27,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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 171 [2025-01-09 03:49:27,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:27,545 INFO L225 Difference]: With dead ends: 18816 [2025-01-09 03:49:27,545 INFO L226 Difference]: Without dead ends: 12543 [2025-01-09 03:49:27,571 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:49:27,572 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 129 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1188 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:49:27,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1188 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:27,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12543 states. [2025-01-09 03:49:28,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12543 to 12535. [2025-01-09 03:49:28,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12535 states, 10431 states have (on average 1.6598600325951491) internal successors, (17314), 10437 states have internal predecessors, (17314), 2075 states have call successors, (2075), 26 states have call predecessors, (2075), 28 states have return successors, (2270), 2073 states have call predecessors, (2270), 2074 states have call successors, (2270) [2025-01-09 03:49:28,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12535 states to 12535 states and 21659 transitions. [2025-01-09 03:49:28,200 INFO L78 Accepts]: Start accepts. Automaton has 12535 states and 21659 transitions. Word has length 171 [2025-01-09 03:49:28,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:28,200 INFO L471 AbstractCegarLoop]: Abstraction has 12535 states and 21659 transitions. [2025-01-09 03:49:28,201 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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:49:28,201 INFO L276 IsEmpty]: Start isEmpty. Operand 12535 states and 21659 transitions. [2025-01-09 03:49:28,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2025-01-09 03:49:28,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:28,251 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:28,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:49:28,252 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:28,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:28,252 INFO L85 PathProgramCache]: Analyzing trace with hash 879373298, now seen corresponding path program 1 times [2025-01-09 03:49:28,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:28,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404034003] [2025-01-09 03:49:28,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:28,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:28,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 172 statements into 1 equivalence classes. [2025-01-09 03:49:28,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 172 of 172 statements. [2025-01-09 03:49:28,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:28,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:28,329 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-09 03:49:28,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:28,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404034003] [2025-01-09 03:49:28,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404034003] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:28,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:28,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:28,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772994763] [2025-01-09 03:49:28,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:28,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:28,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:28,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:28,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:28,331 INFO L87 Difference]: Start difference. First operand 12535 states and 21659 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, (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:49:29,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:29,050 INFO L93 Difference]: Finished difference Result 30061 states and 51859 transitions. [2025-01-09 03:49:29,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:29,050 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, (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 172 [2025-01-09 03:49:29,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:29,164 INFO L225 Difference]: With dead ends: 30061 [2025-01-09 03:49:29,164 INFO L226 Difference]: Without dead ends: 19690 [2025-01-09 03:49:29,220 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:49:29,221 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 127 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1158 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:49:29,221 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1158 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:29,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19690 states. [2025-01-09 03:49:30,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19690 to 19682. [2025-01-09 03:49:30,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19682 states, 16375 states have (on average 1.6362748091603054) internal successors, (26794), 16381 states have internal predecessors, (26794), 3278 states have call successors, (3278), 26 states have call predecessors, (3278), 28 states have return successors, (3617), 3276 states have call predecessors, (3617), 3277 states have call successors, (3617) [2025-01-09 03:49:30,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19682 states to 19682 states and 33689 transitions. [2025-01-09 03:49:30,264 INFO L78 Accepts]: Start accepts. Automaton has 19682 states and 33689 transitions. Word has length 172 [2025-01-09 03:49:30,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:30,264 INFO L471 AbstractCegarLoop]: Abstraction has 19682 states and 33689 transitions. [2025-01-09 03:49:30,264 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, (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:49:30,265 INFO L276 IsEmpty]: Start isEmpty. Operand 19682 states and 33689 transitions. [2025-01-09 03:49:30,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 03:49:30,322 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:30,322 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:49:30,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:49:30,323 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:30,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:30,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1893565929, now seen corresponding path program 1 times [2025-01-09 03:49:30,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:30,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117948709] [2025-01-09 03:49:30,325 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:30,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:30,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 03:49:30,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 03:49:30,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:30,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:30,407 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:49:30,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:30,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117948709] [2025-01-09 03:49:30,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2117948709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:30,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:30,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:30,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454465408] [2025-01-09 03:49:30,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:30,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:30,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:30,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:30,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:30,411 INFO L87 Difference]: Start difference. First operand 19682 states and 33689 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:49:31,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:31,341 INFO L93 Difference]: Finished difference Result 52063 states and 89413 transitions. [2025-01-09 03:49:31,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:31,342 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 154 [2025-01-09 03:49:31,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:31,515 INFO L225 Difference]: With dead ends: 52063 [2025-01-09 03:49:31,515 INFO L226 Difference]: Without dead ends: 35193 [2025-01-09 03:49:31,571 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:49:31,571 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 125 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1186 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:49:31,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1186 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:31,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35193 states. [2025-01-09 03:49:33,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35193 to 35185. [2025-01-09 03:49:33,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35185 states, 29428 states have (on average 1.6329006388473564) internal successors, (48053), 29434 states have internal predecessors, (48053), 5728 states have call successors, (5728), 26 states have call predecessors, (5728), 28 states have return successors, (6341), 5726 states have call predecessors, (6341), 5727 states have call successors, (6341) [2025-01-09 03:49:33,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35185 states to 35185 states and 60122 transitions. [2025-01-09 03:49:33,676 INFO L78 Accepts]: Start accepts. Automaton has 35185 states and 60122 transitions. Word has length 154 [2025-01-09 03:49:33,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:33,677 INFO L471 AbstractCegarLoop]: Abstraction has 35185 states and 60122 transitions. [2025-01-09 03:49:33,677 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:49:33,677 INFO L276 IsEmpty]: Start isEmpty. Operand 35185 states and 60122 transitions. [2025-01-09 03:49:33,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2025-01-09 03:49:33,747 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:33,747 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:33,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:49:33,748 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:33,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:33,748 INFO L85 PathProgramCache]: Analyzing trace with hash -623193108, now seen corresponding path program 1 times [2025-01-09 03:49:33,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:33,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628613864] [2025-01-09 03:49:33,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:33,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:33,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 174 statements into 1 equivalence classes. [2025-01-09 03:49:33,781 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 174 of 174 statements. [2025-01-09 03:49:33,781 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:33,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:33,827 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-09 03:49:33,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:33,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628613864] [2025-01-09 03:49:33,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628613864] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:33,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:33,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:33,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1482341308] [2025-01-09 03:49:33,828 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:33,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:33,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:33,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:33,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:33,830 INFO L87 Difference]: Start difference. First operand 35185 states and 60122 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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:49:35,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:35,528 INFO L93 Difference]: Finished difference Result 96075 states and 164605 transitions. [2025-01-09 03:49:35,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:35,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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 174 [2025-01-09 03:49:35,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:35,883 INFO L225 Difference]: With dead ends: 96075 [2025-01-09 03:49:35,883 INFO L226 Difference]: Without dead ends: 64621 [2025-01-09 03:49:36,010 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:49:36,011 INFO L435 NwaCegarLoop]: 596 mSDtfsCounter, 123 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1186 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:49:36,011 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1186 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:36,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64621 states. [2025-01-09 03:49:38,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64621 to 64613. [2025-01-09 03:49:38,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64613 states, 54343 states have (on average 1.6284894098595954) internal successors, (88497), 54349 states have internal predecessors, (88497), 10241 states have call successors, (10241), 26 states have call predecessors, (10241), 28 states have return successors, (11386), 10239 states have call predecessors, (11386), 10240 states have call successors, (11386) [2025-01-09 03:49:38,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64613 states to 64613 states and 110124 transitions. [2025-01-09 03:49:38,951 INFO L78 Accepts]: Start accepts. Automaton has 64613 states and 110124 transitions. Word has length 174 [2025-01-09 03:49:38,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:38,952 INFO L471 AbstractCegarLoop]: Abstraction has 64613 states and 110124 transitions. [2025-01-09 03:49:38,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 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:49:38,952 INFO L276 IsEmpty]: Start isEmpty. Operand 64613 states and 110124 transitions. [2025-01-09 03:49:39,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-09 03:49:39,057 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:39,057 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:39,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:49:39,057 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:39,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:39,058 INFO L85 PathProgramCache]: Analyzing trace with hash -1106327483, now seen corresponding path program 1 times [2025-01-09 03:49:39,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:39,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1562372608] [2025-01-09 03:49:39,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:39,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:39,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-09 03:49:39,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-09 03:49:39,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:39,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:39,137 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-09 03:49:39,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:39,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1562372608] [2025-01-09 03:49:39,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1562372608] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:39,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:39,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:49:39,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097817422] [2025-01-09 03:49:39,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:39,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:49:39,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:39,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:49:39,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:49:39,139 INFO L87 Difference]: Start difference. First operand 64613 states and 110124 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, (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:49:41,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:41,888 INFO L93 Difference]: Finished difference Result 121217 states and 206950 transitions. [2025-01-09 03:49:41,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:41,889 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, (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 175 [2025-01-09 03:49:41,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:42,913 INFO L225 Difference]: With dead ends: 121217 [2025-01-09 03:49:42,913 INFO L226 Difference]: Without dead ends: 121021 [2025-01-09 03:49:42,973 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:49:42,976 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 118 mSDsluCounter, 594 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1192 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:49:42,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1192 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:43,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121021 states. [2025-01-09 03:49:46,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121021 to 121013. [2025-01-09 03:49:46,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121013 states, 102375 states have (on average 1.623062271062271) internal successors, (166161), 102381 states have internal predecessors, (166161), 18609 states have call successors, (18609), 26 states have call predecessors, (18609), 28 states have return successors, (20800), 18607 states have call predecessors, (20800), 18608 states have call successors, (20800) [2025-01-09 03:49:47,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121013 states to 121013 states and 205570 transitions. [2025-01-09 03:49:47,231 INFO L78 Accepts]: Start accepts. Automaton has 121013 states and 205570 transitions. Word has length 175 [2025-01-09 03:49:47,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:47,232 INFO L471 AbstractCegarLoop]: Abstraction has 121013 states and 205570 transitions. [2025-01-09 03:49:47,232 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, (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:49:47,232 INFO L276 IsEmpty]: Start isEmpty. Operand 121013 states and 205570 transitions. [2025-01-09 03:49:47,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2025-01-09 03:49:47,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:47,386 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:49:47,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:49:47,387 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:47,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:47,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1853584949, now seen corresponding path program 1 times [2025-01-09 03:49:47,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:47,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837859473] [2025-01-09 03:49:47,388 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:47,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:47,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 176 statements into 1 equivalence classes. [2025-01-09 03:49:47,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 176 of 176 statements. [2025-01-09 03:49:47,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:47,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2025-01-09 03:49:47,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:47,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837859473] [2025-01-09 03:49:47,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837859473] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:47,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:47,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:49:47,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031972850] [2025-01-09 03:49:47,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:47,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:49:47,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:47,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:49:47,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:49:47,588 INFO L87 Difference]: Start difference. First operand 121013 states and 205570 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 5 states have internal predecessors, (112), 3 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (18), 4 states have call predecessors, (18), 3 states have call successors, (18)