./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product20.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec8_product20.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14180d3cb690799ed57b4096de70e545e9154e30692708de4df58b96eb76a2f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:26:20,810 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:26:20,874 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:26:20,880 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:26:20,880 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:26:20,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:26:20,902 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:26:20,902 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:26:20,902 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:26:20,903 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:26:20,903 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:26:20,903 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:26:20,904 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:26:20,904 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:26:20,904 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:26:20,904 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:26:20,904 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:26:20,904 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:26:20,905 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:26:20,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:26:20,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:26:20,905 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:26:20,905 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:26:20,905 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:26:20,905 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:26:20,905 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:26:20,905 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:26:20,905 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:26:20,905 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:26:20,905 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:26:20,906 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:26:20,906 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:26:20,906 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:26:20,906 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:26:20,906 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:26:20,906 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:26:20,906 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:26:20,906 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:26:20,907 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:26:20,907 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:26:20,907 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:26:20,907 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:26:20,907 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:26:20,907 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/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 -> 14180d3cb690799ed57b4096de70e545e9154e30692708de4df58b96eb76a2f0 [2025-03-03 14:26:21,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:26:21,115 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:26:21,116 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:26:21,117 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:26:21,117 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:26:21,117 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product20.cil.c [2025-03-03 14:26:22,214 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fd3989b3/7111f6c639374bc2bcdf5545241deea7/FLAG9c9782161 [2025-03-03 14:26:22,531 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:26:22,532 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product20.cil.c [2025-03-03 14:26:22,545 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fd3989b3/7111f6c639374bc2bcdf5545241deea7/FLAG9c9782161 [2025-03-03 14:26:22,789 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8fd3989b3/7111f6c639374bc2bcdf5545241deea7 [2025-03-03 14:26:22,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:26:22,792 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:26:22,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:26:22,793 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:26:22,796 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:26:22,796 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:26:22" (1/1) ... [2025-03-03 14:26:22,797 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4318b3cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:22, skipping insertion in model container [2025-03-03 14:26:22,797 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:26:22" (1/1) ... [2025-03-03 14:26:22,835 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:26:23,070 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product20.cil.c[19452,19465] [2025-03-03 14:26:23,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:26:23,184 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:26:23,190 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-03-03 14:26:23,192 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [414] [2025-03-03 14:26:23,192 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [432] [2025-03-03 14:26:23,192 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [844] [2025-03-03 14:26:23,192 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [853] [2025-03-03 14:26:23,192 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [1933] [2025-03-03 14:26:23,192 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1987] [2025-03-03 14:26:23,192 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2216] [2025-03-03 14:26:23,192 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2321] [2025-03-03 14:26:23,192 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2618] [2025-03-03 14:26:23,192 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2925] [2025-03-03 14:26:23,235 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product20.cil.c[19452,19465] [2025-03-03 14:26:23,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:26:23,321 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:26:23,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:23 WrapperNode [2025-03-03 14:26:23,323 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:26:23,325 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:26:23,325 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:26:23,325 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:26:23,329 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:23" (1/1) ... [2025-03-03 14:26:23,354 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:23" (1/1) ... [2025-03-03 14:26:23,384 INFO L138 Inliner]: procedures = 129, calls = 200, calls flagged for inlining = 56, calls inlined = 49, statements flattened = 963 [2025-03-03 14:26:23,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:26:23,385 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:26:23,385 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:26:23,385 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:26:23,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:23" (1/1) ... [2025-03-03 14:26:23,392 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:23" (1/1) ... [2025-03-03 14:26:23,396 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:23" (1/1) ... [2025-03-03 14:26:23,425 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-03-03 14:26:23,426 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:23" (1/1) ... [2025-03-03 14:26:23,426 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:23" (1/1) ... [2025-03-03 14:26:23,446 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:23" (1/1) ... [2025-03-03 14:26:23,452 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:23" (1/1) ... [2025-03-03 14:26:23,455 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:23" (1/1) ... [2025-03-03 14:26:23,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:23" (1/1) ... [2025-03-03 14:26:23,470 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:26:23,471 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:26:23,472 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:26:23,472 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:26:23,473 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:23" (1/1) ... [2025-03-03 14:26:23,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:26:23,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:23,502 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:26:23,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:26:23,525 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-03 14:26:23,525 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-03 14:26:23,525 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-03 14:26:23,525 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-03 14:26:23,525 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-03 14:26:23,525 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-03 14:26:23,525 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-03 14:26:23,525 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-03 14:26:23,525 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:26:23,525 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:26:23,525 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-03-03 14:26:23,525 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-03-03 14:26:23,525 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:26:23,525 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:26:23,525 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:26:23,525 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:26:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-03 14:26:23,526 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-03 14:26:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:26:23,526 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:26:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:26:23,526 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:26:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:26:23,526 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:26:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:26:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-03 14:26:23,526 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-03 14:26:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:26:23,526 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:26:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:26:23,526 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:26:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:26:23,526 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:26:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:26:23,526 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:26:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-03 14:26:23,526 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-03 14:26:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:26:23,526 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:26:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:26:23,526 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:26:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:26:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:26:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:26:23,526 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:26:23,528 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:26:23,528 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:26:23,528 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-03 14:26:23,528 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-03 14:26:23,528 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:26:23,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:26:23,699 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:26:23,701 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:26:23,807 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567: #res#1 := ~retValue_acc~26#1; [2025-03-03 14:26:23,807 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1522-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~25#1; [2025-03-03 14:26:23,820 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2318-1: createEmail_#res#1 := createEmail_~retValue_acc~35#1; [2025-03-03 14:26:23,829 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1019: #res := ~retValue_acc~18; [2025-03-03 14:26:23,846 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L677: #res := ~retValue_acc~10; [2025-03-03 14:26:23,902 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: #res := ~retValue_acc~11; [2025-03-03 14:26:23,984 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L562: #res := ~retValue_acc~7; [2025-03-03 14:26:24,062 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1345: #res := ~retValue_acc~22; [2025-03-03 14:26:24,196 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1910-1: getClientId_#res#1 := getClientId_~retValue_acc~31#1; [2025-03-03 14:26:24,196 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1475-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~24#1; [2025-03-03 14:26:24,196 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1791-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~29#1; [2025-03-03 14:26:24,196 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1428-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~23#1; [2025-03-03 14:26:24,196 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2890-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~41#1; [2025-03-03 14:26:24,446 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1737-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~28#1; [2025-03-03 14:26:24,446 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2847-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~38#1; [2025-03-03 14:26:24,446 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2865-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~40#1; [2025-03-03 14:26:24,446 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1630-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~27#1; [2025-03-03 14:26:24,446 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2856-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~39#1; [2025-03-03 14:26:24,446 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2957-1: valid_product_#res#1 := valid_product_~retValue_acc~43#1; [2025-03-03 14:26:24,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L525: #res := ~retValue_acc~6; [2025-03-03 14:26:24,580 INFO L? ?]: Removed 483 outVars from TransFormulas that were not future-live. [2025-03-03 14:26:24,580 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:26:24,602 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:26:24,602 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:26:24,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:26:24 BoogieIcfgContainer [2025-03-03 14:26:24,602 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:26:24,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:26:24,606 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:26:24,610 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:26:24,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:26:22" (1/3) ... [2025-03-03 14:26:24,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b2d370b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:26:24, skipping insertion in model container [2025-03-03 14:26:24,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:26:23" (2/3) ... [2025-03-03 14:26:24,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b2d370b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:26:24, skipping insertion in model container [2025-03-03 14:26:24,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:26:24" (3/3) ... [2025-03-03 14:26:24,613 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec8_product20.cil.c [2025-03-03 14:26:24,622 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:26:24,625 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec8_product20.cil.c that has 23 procedures, 364 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:26:24,691 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:26:24,699 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;@6ca18c8c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:26:24,699 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:26:24,702 INFO L276 IsEmpty]: Start isEmpty. Operand has 364 states, 286 states have (on average 1.5769230769230769) internal successors, (451), 291 states have internal predecessors, (451), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-03-03 14:26:24,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-03-03 14:26:24,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:24,714 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:24,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:24,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:24,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1655622403, now seen corresponding path program 1 times [2025-03-03 14:26:24,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:24,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657571670] [2025-03-03 14:26:24,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:24,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:24,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 14:26:24,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 14:26:24,857 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:24,857 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:25,271 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:26:25,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:25,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657571670] [2025-03-03 14:26:25,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657571670] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:25,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1738854664] [2025-03-03 14:26:25,275 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:25,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:25,276 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:25,278 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:25,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:26:25,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-03-03 14:26:25,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-03-03 14:26:25,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:25,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:25,533 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:26:25,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:25,551 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:26:25,552 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:25,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1738854664] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:25,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:25,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:26:25,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73579050] [2025-03-03 14:26:25,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:25,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:26:25,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:25,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:26:25,575 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:25,577 INFO L87 Difference]: Start difference. First operand has 364 states, 286 states have (on average 1.5769230769230769) internal successors, (451), 291 states have internal predecessors, (451), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:25,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:25,622 INFO L93 Difference]: Finished difference Result 536 states and 810 transitions. [2025-03-03 14:26:25,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:26:25,624 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2025-03-03 14:26:25,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:25,631 INFO L225 Difference]: With dead ends: 536 [2025-03-03 14:26:25,631 INFO L226 Difference]: Without dead ends: 357 [2025-03-03 14:26:25,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 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-03-03 14:26:25,636 INFO L435 NwaCegarLoop]: 556 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, 556 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-03-03 14:26:25,637 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:25,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-03-03 14:26:25,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-03-03 14:26:25,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 280 states have (on average 1.575) internal successors, (441), 284 states have internal predecessors, (441), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-03 14:26:25,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 548 transitions. [2025-03-03 14:26:25,695 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 548 transitions. Word has length 98 [2025-03-03 14:26:25,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:25,696 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 548 transitions. [2025-03-03 14:26:25,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:25,696 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 548 transitions. [2025-03-03 14:26:25,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-03-03 14:26:25,703 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:25,703 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:25,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:26:25,904 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:26:25,904 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:25,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:25,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1076605536, now seen corresponding path program 1 times [2025-03-03 14:26:25,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:25,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98201929] [2025-03-03 14:26:25,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:25,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:25,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 14:26:25,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 14:26:25,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:25,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:26,144 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:26:26,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:26,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98201929] [2025-03-03 14:26:26,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98201929] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:26,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028394815] [2025-03-03 14:26:26,144 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:26,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:26,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:26,147 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:26,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:26:26,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-03-03 14:26:26,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-03-03 14:26:26,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:26,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:26,402 INFO L256 TraceCheckSpWp]: Trace formula consists of 999 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:26:26,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:26,436 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:26:26,438 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:26,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028394815] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:26,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:26,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:26:26,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929983121] [2025-03-03 14:26:26,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:26,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:26,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:26,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:26,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:26:26,440 INFO L87 Difference]: Start difference. First operand 357 states and 548 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:26,472 INFO L93 Difference]: Finished difference Result 525 states and 788 transitions. [2025-03-03 14:26:26,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:26,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2025-03-03 14:26:26,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:26,477 INFO L225 Difference]: With dead ends: 525 [2025-03-03 14:26:26,477 INFO L226 Difference]: Without dead ends: 359 [2025-03-03 14:26:26,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 99 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-03-03 14:26:26,481 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 0 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:26,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1092 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:26,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-03-03 14:26:26,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2025-03-03 14:26:26,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 359 states, 282 states have (on average 1.570921985815603) internal successors, (443), 286 states have internal predecessors, (443), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-03-03 14:26:26,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 550 transitions. [2025-03-03 14:26:26,510 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 550 transitions. Word has length 99 [2025-03-03 14:26:26,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:26,511 INFO L471 AbstractCegarLoop]: Abstraction has 359 states and 550 transitions. [2025-03-03 14:26:26,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 550 transitions. [2025-03-03 14:26:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 14:26:26,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:26,513 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:26,522 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:26:26,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:26:26,714 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:26,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:26,715 INFO L85 PathProgramCache]: Analyzing trace with hash -96502674, now seen corresponding path program 1 times [2025-03-03 14:26:26,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:26,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [797371858] [2025-03-03 14:26:26,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:26,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:26,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 14:26:26,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 14:26:26,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:26,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:26,878 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:26:26,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:26,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [797371858] [2025-03-03 14:26:26,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [797371858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:26,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [562804791] [2025-03-03 14:26:26,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:26,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:26,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:26,883 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:26,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:26:27,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 14:26:27,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 14:26:27,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:27,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:27,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 1024 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:26:27,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:27,149 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:26:27,149 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:27,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [562804791] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:27,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:27,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:26:27,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261686484] [2025-03-03 14:26:27,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:27,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:27,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:27,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:27,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:26:27,150 INFO L87 Difference]: Start difference. First operand 359 states and 550 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:27,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:27,186 INFO L93 Difference]: Finished difference Result 765 states and 1191 transitions. [2025-03-03 14:26:27,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:27,189 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 107 [2025-03-03 14:26:27,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:27,192 INFO L225 Difference]: With dead ends: 765 [2025-03-03 14:26:27,192 INFO L226 Difference]: Without dead ends: 433 [2025-03-03 14:26:27,194 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 107 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-03-03 14:26:27,196 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 134 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1073 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-03-03 14:26:27,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1073 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:27,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-03 14:26:27,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 425. [2025-03-03 14:26:27,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 425 states, 334 states have (on average 1.589820359281437) internal successors, (531), 338 states have internal predecessors, (531), 68 states have call successors, (68), 22 states have call predecessors, (68), 22 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2025-03-03 14:26:27,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 666 transitions. [2025-03-03 14:26:27,222 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 666 transitions. Word has length 107 [2025-03-03 14:26:27,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:27,223 INFO L471 AbstractCegarLoop]: Abstraction has 425 states and 666 transitions. [2025-03-03 14:26:27,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 666 transitions. [2025-03-03 14:26:27,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:26:27,227 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:27,227 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:27,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:26:27,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:27,428 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:27,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:27,428 INFO L85 PathProgramCache]: Analyzing trace with hash 301871979, now seen corresponding path program 1 times [2025-03-03 14:26:27,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:27,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621597978] [2025-03-03 14:26:27,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:27,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:27,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:26:27,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:26:27,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:27,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:27,592 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:26:27,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:27,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621597978] [2025-03-03 14:26:27,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621597978] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:27,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147048957] [2025-03-03 14:26:27,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:27,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:27,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:27,595 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:27,596 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:26:27,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:26:27,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:26:27,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:27,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:27,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 1029 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:26:27,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:27,877 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:26:27,878 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:27,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147048957] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:27,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:27,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:26:27,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860544693] [2025-03-03 14:26:27,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:27,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:27,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:27,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:27,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:26:27,879 INFO L87 Difference]: Start difference. First operand 425 states and 666 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:26:27,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:27,935 INFO L93 Difference]: Finished difference Result 841 states and 1322 transitions. [2025-03-03 14:26:27,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:27,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-03-03 14:26:27,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:27,939 INFO L225 Difference]: With dead ends: 841 [2025-03-03 14:26:27,939 INFO L226 Difference]: Without dead ends: 427 [2025-03-03 14:26:27,942 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 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-03-03 14:26:27,943 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 2 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2149 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-03-03 14:26:27,943 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2149 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:27,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 427 states. [2025-03-03 14:26:27,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 427 to 427. [2025-03-03 14:26:27,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 335 states have (on average 1.5880597014925373) internal successors, (532), 340 states have internal predecessors, (532), 68 states have call successors, (68), 22 states have call predecessors, (68), 23 states have return successors, (69), 66 states have call predecessors, (69), 67 states have call successors, (69) [2025-03-03 14:26:27,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 669 transitions. [2025-03-03 14:26:27,959 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 669 transitions. Word has length 108 [2025-03-03 14:26:27,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:27,959 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 669 transitions. [2025-03-03 14:26:27,959 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:26:27,959 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 669 transitions. [2025-03-03 14:26:27,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:26:27,961 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:27,961 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:27,969 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:26:28,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:28,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:28,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:28,162 INFO L85 PathProgramCache]: Analyzing trace with hash -710868771, now seen corresponding path program 1 times [2025-03-03 14:26:28,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:28,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559236202] [2025-03-03 14:26:28,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:28,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:28,179 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:26:28,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:26:28,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:28,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:28,312 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:26:28,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:28,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559236202] [2025-03-03 14:26:28,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559236202] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:28,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690451742] [2025-03-03 14:26:28,313 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:28,313 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:28,313 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:28,315 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:28,317 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:26:28,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:26:28,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:26:28,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:28,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:28,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 1030 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:26:28,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:28,614 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:26:28,616 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:26:28,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690451742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:28,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:26:28,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:26:28,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929976920] [2025-03-03 14:26:28,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:28,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:28,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:28,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:28,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:26:28,618 INFO L87 Difference]: Start difference. First operand 427 states and 669 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:26:28,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:28,677 INFO L93 Difference]: Finished difference Result 843 states and 1327 transitions. [2025-03-03 14:26:28,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:28,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2025-03-03 14:26:28,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:28,681 INFO L225 Difference]: With dead ends: 843 [2025-03-03 14:26:28,681 INFO L226 Difference]: Without dead ends: 429 [2025-03-03 14:26:28,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:26:28,686 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 2 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2135 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-03-03 14:26:28,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2135 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:28,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-03-03 14:26:28,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2025-03-03 14:26:28,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 336 states have (on average 1.5863095238095237) internal successors, (533), 342 states have internal predecessors, (533), 68 states have call successors, (68), 22 states have call predecessors, (68), 24 states have return successors, (74), 66 states have call predecessors, (74), 67 states have call successors, (74) [2025-03-03 14:26:28,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 675 transitions. [2025-03-03 14:26:28,708 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 675 transitions. Word has length 109 [2025-03-03 14:26:28,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:28,709 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 675 transitions. [2025-03-03 14:26:28,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:26:28,709 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 675 transitions. [2025-03-03 14:26:28,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:26:28,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:28,711 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:28,719 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:26:28,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:28,912 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:28,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:28,912 INFO L85 PathProgramCache]: Analyzing trace with hash 237395601, now seen corresponding path program 1 times [2025-03-03 14:26:28,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:28,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768805139] [2025-03-03 14:26:28,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:28,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:28,928 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:26:28,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:26:28,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:28,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:29,052 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:26:29,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:29,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768805139] [2025-03-03 14:26:29,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768805139] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:29,052 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:29,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:26:29,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853844395] [2025-03-03 14:26:29,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:29,053 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:29,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:29,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:29,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:29,054 INFO L87 Difference]: Start difference. First operand 429 states and 675 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:26:29,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:29,095 INFO L93 Difference]: Finished difference Result 835 states and 1318 transitions. [2025-03-03 14:26:29,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:29,096 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2025-03-03 14:26:29,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:29,099 INFO L225 Difference]: With dead ends: 835 [2025-03-03 14:26:29,100 INFO L226 Difference]: Without dead ends: 429 [2025-03-03 14:26:29,102 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-03-03 14:26:29,103 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 2 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2153 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-03-03 14:26:29,103 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2153 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:29,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-03-03 14:26:29,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2025-03-03 14:26:29,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 336 states have (on average 1.5863095238095237) internal successors, (533), 342 states have internal predecessors, (533), 68 states have call successors, (68), 22 states have call predecessors, (68), 24 states have return successors, (73), 66 states have call predecessors, (73), 67 states have call successors, (73) [2025-03-03 14:26:29,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 674 transitions. [2025-03-03 14:26:29,133 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 674 transitions. Word has length 110 [2025-03-03 14:26:29,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:29,134 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 674 transitions. [2025-03-03 14:26:29,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:26:29,134 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 674 transitions. [2025-03-03 14:26:29,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:26:29,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:29,136 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:29,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:26:29,136 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:29,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:29,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1908820321, now seen corresponding path program 2 times [2025-03-03 14:26:29,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:29,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995945548] [2025-03-03 14:26:29,137 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:26:29,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:29,158 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 111 statements into 2 equivalence classes. [2025-03-03 14:26:29,171 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:26:29,171 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:26:29,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:29,261 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:26:29,262 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:29,262 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995945548] [2025-03-03 14:26:29,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995945548] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:29,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:29,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:26:29,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077766876] [2025-03-03 14:26:29,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:29,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:29,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:29,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:29,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:29,263 INFO L87 Difference]: Start difference. First operand 429 states and 674 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:26:29,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:29,309 INFO L93 Difference]: Finished difference Result 833 states and 1313 transitions. [2025-03-03 14:26:29,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:29,309 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2025-03-03 14:26:29,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:29,313 INFO L225 Difference]: With dead ends: 833 [2025-03-03 14:26:29,313 INFO L226 Difference]: Without dead ends: 429 [2025-03-03 14:26:29,316 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-03-03 14:26:29,317 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 2 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:29,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2139 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:29,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2025-03-03 14:26:29,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 429. [2025-03-03 14:26:29,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 336 states have (on average 1.5863095238095237) internal successors, (533), 342 states have internal predecessors, (533), 68 states have call successors, (68), 22 states have call predecessors, (68), 24 states have return successors, (72), 66 states have call predecessors, (72), 67 states have call successors, (72) [2025-03-03 14:26:29,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 673 transitions. [2025-03-03 14:26:29,337 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 673 transitions. Word has length 111 [2025-03-03 14:26:29,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:29,338 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 673 transitions. [2025-03-03 14:26:29,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:26:29,338 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 673 transitions. [2025-03-03 14:26:29,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:26:29,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:29,340 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-03 14:26:29,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:26:29,340 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:29,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:29,341 INFO L85 PathProgramCache]: Analyzing trace with hash -319692109, now seen corresponding path program 3 times [2025-03-03 14:26:29,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:29,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409422438] [2025-03-03 14:26:29,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:26:29,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:29,359 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 112 statements into 3 equivalence classes. [2025-03-03 14:26:29,368 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 100 of 112 statements. [2025-03-03 14:26:29,368 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-03-03 14:26:29,368 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:29,451 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:26:29,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:29,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409422438] [2025-03-03 14:26:29,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409422438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:29,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:29,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:26:29,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298740024] [2025-03-03 14:26:29,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:29,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:29,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:29,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:29,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:29,453 INFO L87 Difference]: Start difference. First operand 429 states and 673 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:26:29,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:29,497 INFO L93 Difference]: Finished difference Result 835 states and 1319 transitions. [2025-03-03 14:26:29,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:29,497 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2025-03-03 14:26:29,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:29,500 INFO L225 Difference]: With dead ends: 835 [2025-03-03 14:26:29,500 INFO L226 Difference]: Without dead ends: 431 [2025-03-03 14:26:29,502 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-03-03 14:26:29,502 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 1 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2150 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-03-03 14:26:29,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2150 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:29,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2025-03-03 14:26:29,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 431. [2025-03-03 14:26:29,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 337 states have (on average 1.5845697329376855) internal successors, (534), 344 states have internal predecessors, (534), 68 states have call successors, (68), 22 states have call predecessors, (68), 25 states have return successors, (77), 66 states have call predecessors, (77), 67 states have call successors, (77) [2025-03-03 14:26:29,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 679 transitions. [2025-03-03 14:26:29,517 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 679 transitions. Word has length 112 [2025-03-03 14:26:29,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:29,517 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 679 transitions. [2025-03-03 14:26:29,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:26:29,518 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 679 transitions. [2025-03-03 14:26:29,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:26:29,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:29,520 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:29,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:26:29,520 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:29,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:29,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1237478846, now seen corresponding path program 1 times [2025-03-03 14:26:29,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:29,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726498465] [2025-03-03 14:26:29,521 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:29,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:29,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:26:29,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:26:29,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:29,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:29,628 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:26:29,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:29,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726498465] [2025-03-03 14:26:29,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726498465] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:29,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:29,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:26:29,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728226327] [2025-03-03 14:26:29,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:29,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:26:29,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:29,629 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:26:29,629 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:26:29,629 INFO L87 Difference]: Start difference. First operand 431 states and 679 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:26:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:29,678 INFO L93 Difference]: Finished difference Result 841 states and 1329 transitions. [2025-03-03 14:26:29,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:26:29,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 113 [2025-03-03 14:26:29,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:29,681 INFO L225 Difference]: With dead ends: 841 [2025-03-03 14:26:29,681 INFO L226 Difference]: Without dead ends: 433 [2025-03-03 14:26:29,682 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-03-03 14:26:29,683 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 1 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2156 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-03-03 14:26:29,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2156 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:29,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2025-03-03 14:26:29,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 433. [2025-03-03 14:26:29,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 433 states, 338 states have (on average 1.5828402366863905) internal successors, (535), 346 states have internal predecessors, (535), 68 states have call successors, (68), 22 states have call predecessors, (68), 26 states have return successors, (79), 66 states have call predecessors, (79), 67 states have call successors, (79) [2025-03-03 14:26:29,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 682 transitions. [2025-03-03 14:26:29,698 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 682 transitions. Word has length 113 [2025-03-03 14:26:29,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:29,698 INFO L471 AbstractCegarLoop]: Abstraction has 433 states and 682 transitions. [2025-03-03 14:26:29,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:26:29,698 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 682 transitions. [2025-03-03 14:26:29,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:26:29,700 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:29,700 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:29,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:26:29,701 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:29,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:29,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1020240373, now seen corresponding path program 1 times [2025-03-03 14:26:29,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:29,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101164953] [2025-03-03 14:26:29,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:29,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:29,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:26:29,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:26:29,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:29,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:29,828 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-03 14:26:29,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:29,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101164953] [2025-03-03 14:26:29,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101164953] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:26:29,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345786908] [2025-03-03 14:26:29,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:29,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:29,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:26:29,831 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:26:29,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:26:29,953 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:26:30,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:26:30,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:30,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:30,037 INFO L256 TraceCheckSpWp]: Trace formula consists of 1035 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:26:30,040 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:26:30,067 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:30,067 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:26:30,137 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:30,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345786908] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:26:30,138 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:26:30,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-03 14:26:30,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871114298] [2025-03-03 14:26:30,138 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:26:30,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:26:30,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:30,139 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:26:30,139 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:26:30,139 INFO L87 Difference]: Start difference. First operand 433 states and 682 transitions. Second operand has 11 states, 10 states have (on average 12.2) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-03 14:26:30,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:30,705 INFO L93 Difference]: Finished difference Result 1276 states and 2094 transitions. [2025-03-03 14:26:30,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:26:30,705 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 12.2) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 114 [2025-03-03 14:26:30,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:30,710 INFO L225 Difference]: With dead ends: 1276 [2025-03-03 14:26:30,710 INFO L226 Difference]: Without dead ends: 872 [2025-03-03 14:26:30,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 225 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-03-03 14:26:30,712 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 1333 mSDsluCounter, 3387 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1333 SdHoareTripleChecker+Valid, 3925 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:30,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1333 Valid, 3925 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:26:30,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 872 states. [2025-03-03 14:26:30,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 872 to 848. [2025-03-03 14:26:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 848 states, 674 states have (on average 1.629080118694362) internal successors, (1098), 681 states have internal predecessors, (1098), 147 states have call successors, (147), 23 states have call predecessors, (147), 26 states have return successors, (168), 145 states have call predecessors, (168), 146 states have call successors, (168) [2025-03-03 14:26:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 848 states to 848 states and 1413 transitions. [2025-03-03 14:26:30,745 INFO L78 Accepts]: Start accepts. Automaton has 848 states and 1413 transitions. Word has length 114 [2025-03-03 14:26:30,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:30,745 INFO L471 AbstractCegarLoop]: Abstraction has 848 states and 1413 transitions. [2025-03-03 14:26:30,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 12.2) internal successors, (122), 11 states have internal predecessors, (122), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-03-03 14:26:30,745 INFO L276 IsEmpty]: Start isEmpty. Operand 848 states and 1413 transitions. [2025-03-03 14:26:30,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:26:30,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:30,749 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:30,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:26:30,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:26:30,950 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:30,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:30,951 INFO L85 PathProgramCache]: Analyzing trace with hash -2053131205, now seen corresponding path program 1 times [2025-03-03 14:26:30,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:30,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832551626] [2025-03-03 14:26:30,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:30,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:30,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:26:30,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:26:30,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:30,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:31,005 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:31,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:31,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832551626] [2025-03-03 14:26:31,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832551626] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:31,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:31,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:31,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802927526] [2025-03-03 14:26:31,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:31,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:31,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:31,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:31,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:31,006 INFO L87 Difference]: Start difference. First operand 848 states and 1413 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:31,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:31,061 INFO L93 Difference]: Finished difference Result 2011 states and 3404 transitions. [2025-03-03 14:26:31,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:31,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2025-03-03 14:26:31,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:31,068 INFO L225 Difference]: With dead ends: 2011 [2025-03-03 14:26:31,068 INFO L226 Difference]: Without dead ends: 1241 [2025-03-03 14:26:31,070 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-03-03 14:26:31,070 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 131 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1098 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-03-03 14:26:31,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1098 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:31,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2025-03-03 14:26:31,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1233. [2025-03-03 14:26:31,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1233 states, 980 states have (on average 1.6459183673469389) internal successors, (1613), 987 states have internal predecessors, (1613), 226 states have call successors, (226), 23 states have call predecessors, (226), 26 states have return successors, (257), 224 states have call predecessors, (257), 225 states have call successors, (257) [2025-03-03 14:26:31,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1233 states to 1233 states and 2096 transitions. [2025-03-03 14:26:31,123 INFO L78 Accepts]: Start accepts. Automaton has 1233 states and 2096 transitions. Word has length 117 [2025-03-03 14:26:31,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:31,124 INFO L471 AbstractCegarLoop]: Abstraction has 1233 states and 2096 transitions. [2025-03-03 14:26:31,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:31,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1233 states and 2096 transitions. [2025-03-03 14:26:31,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:26:31,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:31,130 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:31,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:26:31,130 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:31,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:31,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1500767737, now seen corresponding path program 1 times [2025-03-03 14:26:31,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:31,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751159014] [2025-03-03 14:26:31,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:31,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:31,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:26:31,154 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:26:31,154 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:31,154 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:31,184 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:31,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:31,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751159014] [2025-03-03 14:26:31,185 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751159014] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:31,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:31,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:31,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397878740] [2025-03-03 14:26:31,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:31,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:31,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:31,186 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:31,186 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:31,186 INFO L87 Difference]: Start difference. First operand 1233 states and 2096 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:31,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:31,250 INFO L93 Difference]: Finished difference Result 2974 states and 5086 transitions. [2025-03-03 14:26:31,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:31,251 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-03-03 14:26:31,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:31,263 INFO L225 Difference]: With dead ends: 2974 [2025-03-03 14:26:31,264 INFO L226 Difference]: Without dead ends: 1870 [2025-03-03 14:26:31,269 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-03-03 14:26:31,270 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 129 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1094 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-03-03 14:26:31,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1094 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:31,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1870 states. [2025-03-03 14:26:31,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1870 to 1862. [2025-03-03 14:26:31,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1862 states, 1490 states have (on average 1.6530201342281878) internal successors, (2463), 1497 states have internal predecessors, (2463), 345 states have call successors, (345), 23 states have call predecessors, (345), 26 states have return successors, (376), 343 states have call predecessors, (376), 344 states have call successors, (376) [2025-03-03 14:26:31,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1862 states to 1862 states and 3184 transitions. [2025-03-03 14:26:31,363 INFO L78 Accepts]: Start accepts. Automaton has 1862 states and 3184 transitions. Word has length 118 [2025-03-03 14:26:31,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:31,364 INFO L471 AbstractCegarLoop]: Abstraction has 1862 states and 3184 transitions. [2025-03-03 14:26:31,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:31,365 INFO L276 IsEmpty]: Start isEmpty. Operand 1862 states and 3184 transitions. [2025-03-03 14:26:31,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:26:31,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:31,373 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:31,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:26:31,373 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:31,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:31,374 INFO L85 PathProgramCache]: Analyzing trace with hash 1066774202, now seen corresponding path program 1 times [2025-03-03 14:26:31,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:31,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528000684] [2025-03-03 14:26:31,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:31,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:31,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:26:31,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:26:31,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:31,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:31,470 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:31,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:31,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528000684] [2025-03-03 14:26:31,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528000684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:31,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:31,472 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:31,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250938527] [2025-03-03 14:26:31,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:31,472 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:31,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:31,473 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:31,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:31,474 INFO L87 Difference]: Start difference. First operand 1862 states and 3184 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:31,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:31,562 INFO L93 Difference]: Finished difference Result 4436 states and 7645 transitions. [2025-03-03 14:26:31,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:31,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-03-03 14:26:31,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:31,580 INFO L225 Difference]: With dead ends: 4436 [2025-03-03 14:26:31,580 INFO L226 Difference]: Without dead ends: 2835 [2025-03-03 14:26:31,587 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-03-03 14:26:31,589 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 127 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1083 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-03-03 14:26:31,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1083 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:31,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2025-03-03 14:26:31,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2827. [2025-03-03 14:26:31,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2827 states, 2293 states have (on average 1.6589620584387266) internal successors, (3804), 2300 states have internal predecessors, (3804), 507 states have call successors, (507), 23 states have call predecessors, (507), 26 states have return successors, (554), 505 states have call predecessors, (554), 506 states have call successors, (554) [2025-03-03 14:26:31,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 4865 transitions. [2025-03-03 14:26:31,721 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 4865 transitions. Word has length 119 [2025-03-03 14:26:31,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:31,721 INFO L471 AbstractCegarLoop]: Abstraction has 2827 states and 4865 transitions. [2025-03-03 14:26:31,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:31,722 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 4865 transitions. [2025-03-03 14:26:31,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:26:31,732 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:31,733 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:31,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:26:31,733 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:31,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:31,734 INFO L85 PathProgramCache]: Analyzing trace with hash 742367514, now seen corresponding path program 1 times [2025-03-03 14:26:31,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:31,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779188069] [2025-03-03 14:26:31,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:31,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:31,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:26:31,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:26:31,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:31,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:31,826 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:31,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:31,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779188069] [2025-03-03 14:26:31,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779188069] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:31,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:31,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:31,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46618093] [2025-03-03 14:26:31,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:31,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:31,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:31,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:31,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:31,829 INFO L87 Difference]: Start difference. First operand 2827 states and 4865 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:31,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:31,958 INFO L93 Difference]: Finished difference Result 6744 states and 11692 transitions. [2025-03-03 14:26:31,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:31,959 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-03-03 14:26:31,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:31,983 INFO L225 Difference]: With dead ends: 6744 [2025-03-03 14:26:31,984 INFO L226 Difference]: Without dead ends: 4393 [2025-03-03 14:26:31,994 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-03-03 14:26:31,995 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 125 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1083 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-03-03 14:26:31,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1083 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:31,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4393 states. [2025-03-03 14:26:32,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4393 to 4385. [2025-03-03 14:26:32,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4385 states, 3606 states have (on average 1.6633388796450361) internal successors, (5998), 3613 states have internal predecessors, (5998), 752 states have call successors, (752), 23 states have call predecessors, (752), 26 states have return successors, (825), 750 states have call predecessors, (825), 751 states have call successors, (825) [2025-03-03 14:26:32,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4385 states to 4385 states and 7575 transitions. [2025-03-03 14:26:32,193 INFO L78 Accepts]: Start accepts. Automaton has 4385 states and 7575 transitions. Word has length 120 [2025-03-03 14:26:32,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:32,193 INFO L471 AbstractCegarLoop]: Abstraction has 4385 states and 7575 transitions. [2025-03-03 14:26:32,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:32,194 INFO L276 IsEmpty]: Start isEmpty. Operand 4385 states and 7575 transitions. [2025-03-03 14:26:32,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:26:32,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:32,208 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:32,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:26:32,208 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:32,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:32,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1907599961, now seen corresponding path program 1 times [2025-03-03 14:26:32,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:32,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493486499] [2025-03-03 14:26:32,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:32,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:32,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:26:32,228 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:26:32,228 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:32,228 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:32,254 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:32,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:32,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493486499] [2025-03-03 14:26:32,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493486499] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:32,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:32,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:32,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963486826] [2025-03-03 14:26:32,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:32,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:32,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:32,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:32,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:32,255 INFO L87 Difference]: Start difference. First operand 4385 states and 7575 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:32,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:32,491 INFO L93 Difference]: Finished difference Result 10859 states and 18865 transitions. [2025-03-03 14:26:32,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:32,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-03-03 14:26:32,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:32,542 INFO L225 Difference]: With dead ends: 10859 [2025-03-03 14:26:32,542 INFO L226 Difference]: Without dead ends: 7197 [2025-03-03 14:26:32,560 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-03-03 14:26:32,561 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 123 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1103 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-03-03 14:26:32,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1103 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:32,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7197 states. [2025-03-03 14:26:32,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7197 to 7189. [2025-03-03 14:26:32,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7189 states, 5917 states have (on average 1.6592868007436201) internal successors, (9818), 5924 states have internal predecessors, (9818), 1245 states have call successors, (1245), 23 states have call predecessors, (1245), 26 states have return successors, (1362), 1243 states have call predecessors, (1362), 1244 states have call successors, (1362) [2025-03-03 14:26:32,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7189 states to 7189 states and 12425 transitions. [2025-03-03 14:26:32,981 INFO L78 Accepts]: Start accepts. Automaton has 7189 states and 12425 transitions. Word has length 121 [2025-03-03 14:26:32,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:32,982 INFO L471 AbstractCegarLoop]: Abstraction has 7189 states and 12425 transitions. [2025-03-03 14:26:32,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:32,982 INFO L276 IsEmpty]: Start isEmpty. Operand 7189 states and 12425 transitions. [2025-03-03 14:26:33,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 14:26:33,003 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:33,003 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:33,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:26:33,003 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:33,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:33,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1274047621, now seen corresponding path program 1 times [2025-03-03 14:26:33,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:33,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989220666] [2025-03-03 14:26:33,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:33,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:33,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:26:33,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:26:33,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:33,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:33,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:33,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989220666] [2025-03-03 14:26:33,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989220666] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:33,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:33,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:33,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675490139] [2025-03-03 14:26:33,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:33,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:33,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:33,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:33,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:33,052 INFO L87 Difference]: Start difference. First operand 7189 states and 12425 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:33,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:33,350 INFO L93 Difference]: Finished difference Result 18174 states and 31613 transitions. [2025-03-03 14:26:33,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:33,350 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-03-03 14:26:33,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:33,410 INFO L225 Difference]: With dead ends: 18174 [2025-03-03 14:26:33,410 INFO L226 Difference]: Without dead ends: 12104 [2025-03-03 14:26:33,434 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-03-03 14:26:33,434 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 121 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1096 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-03-03 14:26:33,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1096 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:33,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12104 states. [2025-03-03 14:26:33,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12104 to 12096. [2025-03-03 14:26:33,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12096 states, 10002 states have (on average 1.659368126374725) internal successors, (16597), 10009 states have internal predecessors, (16597), 2067 states have call successors, (2067), 23 states have call predecessors, (2067), 26 states have return successors, (2262), 2065 states have call predecessors, (2262), 2066 states have call successors, (2262) [2025-03-03 14:26:33,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12096 states to 12096 states and 20926 transitions. [2025-03-03 14:26:33,954 INFO L78 Accepts]: Start accepts. Automaton has 12096 states and 20926 transitions. Word has length 122 [2025-03-03 14:26:33,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:33,955 INFO L471 AbstractCegarLoop]: Abstraction has 12096 states and 20926 transitions. [2025-03-03 14:26:33,955 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, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:33,956 INFO L276 IsEmpty]: Start isEmpty. Operand 12096 states and 20926 transitions. [2025-03-03 14:26:33,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:26:33,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:33,978 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:33,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:26:33,978 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:33,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:33,978 INFO L85 PathProgramCache]: Analyzing trace with hash 586929560, now seen corresponding path program 1 times [2025-03-03 14:26:33,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:33,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912980578] [2025-03-03 14:26:33,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:33,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:33,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:26:33,998 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:26:33,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:33,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:34,027 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:34,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:34,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912980578] [2025-03-03 14:26:34,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912980578] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:34,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:34,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:34,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929839906] [2025-03-03 14:26:34,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:34,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:34,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:34,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:34,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:34,030 INFO L87 Difference]: Start difference. First operand 12096 states and 20926 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:34,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:34,591 INFO L93 Difference]: Finished difference Result 28930 states and 49990 transitions. [2025-03-03 14:26:34,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:34,591 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2025-03-03 14:26:34,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:34,680 INFO L225 Difference]: With dead ends: 28930 [2025-03-03 14:26:34,681 INFO L226 Difference]: Without dead ends: 18920 [2025-03-03 14:26:34,730 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-03-03 14:26:34,731 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 119 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1066 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-03-03 14:26:34,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1066 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:34,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18920 states. [2025-03-03 14:26:35,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18920 to 18912. [2025-03-03 14:26:35,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18912 states, 15615 states have (on average 1.6349663784822286) internal successors, (25530), 15622 states have internal predecessors, (25530), 3270 states have call successors, (3270), 23 states have call predecessors, (3270), 26 states have return successors, (3609), 3268 states have call predecessors, (3609), 3269 states have call successors, (3609) [2025-03-03 14:26:35,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18912 states to 18912 states and 32409 transitions. [2025-03-03 14:26:35,531 INFO L78 Accepts]: Start accepts. Automaton has 18912 states and 32409 transitions. Word has length 123 [2025-03-03 14:26:35,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:35,531 INFO L471 AbstractCegarLoop]: Abstraction has 18912 states and 32409 transitions. [2025-03-03 14:26:35,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:35,532 INFO L276 IsEmpty]: Start isEmpty. Operand 18912 states and 32409 transitions. [2025-03-03 14:26:35,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 14:26:35,561 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:35,561 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:35,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:26:35,561 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:35,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:35,562 INFO L85 PathProgramCache]: Analyzing trace with hash -1482775908, now seen corresponding path program 1 times [2025-03-03 14:26:35,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:35,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099261719] [2025-03-03 14:26:35,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:35,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:35,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:26:35,587 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:26:35,588 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:35,588 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:35,616 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:35,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:35,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099261719] [2025-03-03 14:26:35,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099261719] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:35,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:35,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:35,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900019997] [2025-03-03 14:26:35,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:35,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:35,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:35,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:35,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:35,618 INFO L87 Difference]: Start difference. First operand 18912 states and 32409 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:36,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:36,363 INFO L93 Difference]: Finished difference Result 49967 states and 85973 transitions. [2025-03-03 14:26:36,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:36,364 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2025-03-03 14:26:36,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:36,494 INFO L225 Difference]: With dead ends: 49967 [2025-03-03 14:26:36,495 INFO L226 Difference]: Without dead ends: 33775 [2025-03-03 14:26:36,534 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-03-03 14:26:36,535 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 117 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1086 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-03-03 14:26:36,535 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1086 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:36,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33775 states. [2025-03-03 14:26:37,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33775 to 33767. [2025-03-03 14:26:37,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33767 states, 28020 states have (on average 1.6320485367594575) internal successors, (45730), 28027 states have internal predecessors, (45730), 5720 states have call successors, (5720), 23 states have call predecessors, (5720), 26 states have return successors, (6333), 5718 states have call predecessors, (6333), 5719 states have call successors, (6333) [2025-03-03 14:26:38,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33767 states to 33767 states and 57783 transitions. [2025-03-03 14:26:38,047 INFO L78 Accepts]: Start accepts. Automaton has 33767 states and 57783 transitions. Word has length 124 [2025-03-03 14:26:38,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:38,048 INFO L471 AbstractCegarLoop]: Abstraction has 33767 states and 57783 transitions. [2025-03-03 14:26:38,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:38,048 INFO L276 IsEmpty]: Start isEmpty. Operand 33767 states and 57783 transitions. [2025-03-03 14:26:38,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 14:26:38,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:38,078 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:38,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:26:38,078 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:38,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:38,079 INFO L85 PathProgramCache]: Analyzing trace with hash 2121508855, now seen corresponding path program 1 times [2025-03-03 14:26:38,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:38,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137333682] [2025-03-03 14:26:38,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:38,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:38,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:26:38,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:26:38,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:38,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:38,147 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:38,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:38,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137333682] [2025-03-03 14:26:38,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137333682] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:38,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:38,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:38,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52022443] [2025-03-03 14:26:38,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:38,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:38,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:38,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:38,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:38,149 INFO L87 Difference]: Start difference. First operand 33767 states and 57783 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:39,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:39,550 INFO L93 Difference]: Finished difference Result 92059 states and 158060 transitions. [2025-03-03 14:26:39,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:39,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2025-03-03 14:26:39,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:39,789 INFO L225 Difference]: With dead ends: 92059 [2025-03-03 14:26:39,790 INFO L226 Difference]: Without dead ends: 61919 [2025-03-03 14:26:39,864 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-03-03 14:26:39,865 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 115 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1086 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-03-03 14:26:39,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1086 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:39,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61919 states. [2025-03-03 14:26:41,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61919 to 61911. [2025-03-03 14:26:41,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61911 states, 51651 states have (on average 1.6280807728795184) internal successors, (84092), 51658 states have internal predecessors, (84092), 10233 states have call successors, (10233), 23 states have call predecessors, (10233), 26 states have return successors, (11378), 10231 states have call predecessors, (11378), 10232 states have call successors, (11378) [2025-03-03 14:26:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61911 states to 61911 states and 105703 transitions. [2025-03-03 14:26:42,118 INFO L78 Accepts]: Start accepts. Automaton has 61911 states and 105703 transitions. Word has length 125 [2025-03-03 14:26:42,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:42,118 INFO L471 AbstractCegarLoop]: Abstraction has 61911 states and 105703 transitions. [2025-03-03 14:26:42,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:42,119 INFO L276 IsEmpty]: Start isEmpty. Operand 61911 states and 105703 transitions. [2025-03-03 14:26:42,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 14:26:42,147 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:42,147 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:42,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:26:42,147 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:42,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:42,148 INFO L85 PathProgramCache]: Analyzing trace with hash -25238947, now seen corresponding path program 1 times [2025-03-03 14:26:42,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:42,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063368358] [2025-03-03 14:26:42,148 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:42,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:42,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:26:42,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:26:42,174 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:42,174 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:42,207 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:42,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:42,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063368358] [2025-03-03 14:26:42,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063368358] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:42,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:42,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:26:42,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110943456] [2025-03-03 14:26:42,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:42,209 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:26:42,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:42,209 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:26:42,209 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:26:42,210 INFO L87 Difference]: Start difference. First operand 61911 states and 105703 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:44,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:44,770 INFO L93 Difference]: Finished difference Result 115925 states and 198358 transitions. [2025-03-03 14:26:44,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:26:44,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2025-03-03 14:26:44,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:45,175 INFO L225 Difference]: With dead ends: 115925 [2025-03-03 14:26:45,175 INFO L226 Difference]: Without dead ends: 115759 [2025-03-03 14:26:45,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-03-03 14:26:45,223 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 110 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1092 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-03-03 14:26:45,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1092 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:26:45,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115759 states. [2025-03-03 14:26:48,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115759 to 115751. [2025-03-03 14:26:48,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115751 states, 97123 states have (on average 1.6229626350092152) internal successors, (157627), 97130 states have internal predecessors, (157627), 18601 states have call successors, (18601), 23 states have call predecessors, (18601), 26 states have return successors, (20792), 18599 states have call predecessors, (20792), 18600 states have call successors, (20792) [2025-03-03 14:26:48,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115751 states to 115751 states and 197020 transitions. [2025-03-03 14:26:48,960 INFO L78 Accepts]: Start accepts. Automaton has 115751 states and 197020 transitions. Word has length 126 [2025-03-03 14:26:48,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:26:48,960 INFO L471 AbstractCegarLoop]: Abstraction has 115751 states and 197020 transitions. [2025-03-03 14:26:48,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:26:48,961 INFO L276 IsEmpty]: Start isEmpty. Operand 115751 states and 197020 transitions. [2025-03-03 14:26:48,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 14:26:48,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:26:48,991 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:26:48,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:26:48,992 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:26:48,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:26:48,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1586399766, now seen corresponding path program 1 times [2025-03-03 14:26:48,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:26:48,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469068535] [2025-03-03 14:26:48,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:26:48,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:26:49,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:26:49,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:26:49,017 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:26:49,017 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:26:49,279 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:26:49,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:26:49,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469068535] [2025-03-03 14:26:49,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469068535] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:26:49,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:26:49,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-03 14:26:49,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [889470621] [2025-03-03 14:26:49,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:26:49,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 14:26:49,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:26:49,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 14:26:49,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-03 14:26:49,281 INFO L87 Difference]: Start difference. First operand 115751 states and 197020 transitions. Second operand has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-03-03 14:26:54,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:26:54,697 INFO L93 Difference]: Finished difference Result 230598 states and 397991 transitions. [2025-03-03 14:26:54,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 14:26:54,698 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 127 [2025-03-03 14:26:54,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:26:55,646 INFO L225 Difference]: With dead ends: 230598 [2025-03-03 14:26:55,646 INFO L226 Difference]: Without dead ends: 230438 [2025-03-03 14:26:55,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2025-03-03 14:26:55,739 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 1388 mSDsluCounter, 5505 mSDsCounter, 0 mSdLazyCounter, 1032 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1388 SdHoareTripleChecker+Valid, 6147 SdHoareTripleChecker+Invalid, 1416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 1032 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 14:26:55,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1388 Valid, 6147 Invalid, 1416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 1032 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 14:26:55,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230438 states.