./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec6_product20.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec6_product20.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash d4216ddf014ff953368f9c10444517e5ad475a960f2c91abb81cda95e6b2b3bf --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:55:04,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:55:04,087 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:55:04,092 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:55:04,092 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:55:04,107 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:55:04,108 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:55:04,108 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:55:04,108 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:55:04,108 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:55:04,109 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:55:04,109 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:55:04,109 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:55:04,109 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:55:04,109 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:55:04,109 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:55:04,109 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:55:04,109 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:55:04,109 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:55:04,110 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:55:04,110 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:55:04,110 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:55:04,110 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:55:04,110 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:55:04,110 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:55:04,110 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:55:04,110 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:55:04,110 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:55:04,110 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:55:04,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:55:04,110 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:55:04,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:55:04,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:55:04,110 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:55:04,110 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:55:04,111 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:55:04,111 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:55:04,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:55:04,111 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:55:04,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:55:04,111 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:55:04,111 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:55:04,111 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:55:04,111 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:55:04,111 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:55:04,111 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:55:04,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:55:04,111 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:55:04,111 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d4216ddf014ff953368f9c10444517e5ad475a960f2c91abb81cda95e6b2b3bf [2025-01-09 03:55:04,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:55:04,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:55:04,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:55:04,388 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:55:04,388 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:55:04,389 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec6_product20.cil.c [2025-01-09 03:55:05,587 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b11baac8d/56c7d56c944e4c3f8ffc6ac3a585a8d7/FLAG9c5bfab48 [2025-01-09 03:55:05,948 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:55:05,948 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product20.cil.c [2025-01-09 03:55:05,964 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b11baac8d/56c7d56c944e4c3f8ffc6ac3a585a8d7/FLAG9c5bfab48 [2025-01-09 03:55:06,148 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b11baac8d/56c7d56c944e4c3f8ffc6ac3a585a8d7 [2025-01-09 03:55:06,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:55:06,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:55:06,152 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:55:06,152 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:55:06,155 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:55:06,156 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:55:06" (1/1) ... [2025-01-09 03:55:06,157 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b246034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:06, skipping insertion in model container [2025-01-09 03:55:06,157 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:55:06" (1/1) ... [2025-01-09 03:55:06,199 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:55:06,602 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product20.cil.c[56376,56389] [2025-01-09 03:55:06,637 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:55:06,648 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:55:06,654 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-01-09 03:55:06,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [97] [2025-01-09 03:55:06,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [326] [2025-01-09 03:55:06,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1406] [2025-01-09 03:55:06,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1772] [2025-01-09 03:55:06,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptDecrypt_spec.i","") [2184] [2025-01-09 03:55:06,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2234] [2025-01-09 03:55:06,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2528] [2025-01-09 03:55:06,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2537] [2025-01-09 03:55:06,656 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2846] [2025-01-09 03:55:06,657 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2863] [2025-01-09 03:55:06,728 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec6_product20.cil.c[56376,56389] [2025-01-09 03:55:06,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:55:06,779 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:55:06,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:06 WrapperNode [2025-01-09 03:55:06,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:55:06,782 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:55:06,782 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:55:06,782 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:55:06,786 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:06" (1/1) ... [2025-01-09 03:55:06,803 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:06" (1/1) ... [2025-01-09 03:55:06,835 INFO L138 Inliner]: procedures = 129, calls = 202, calls flagged for inlining = 54, calls inlined = 47, statements flattened = 937 [2025-01-09 03:55:06,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:55:06,836 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:55:06,836 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:55:06,836 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:55:06,843 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:06" (1/1) ... [2025-01-09 03:55:06,843 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:06" (1/1) ... [2025-01-09 03:55:06,847 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:06" (1/1) ... [2025-01-09 03:55:06,881 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-01-09 03:55:06,881 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:06" (1/1) ... [2025-01-09 03:55:06,881 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:06" (1/1) ... [2025-01-09 03:55:06,899 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:06" (1/1) ... [2025-01-09 03:55:06,901 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:06" (1/1) ... [2025-01-09 03:55:06,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:06" (1/1) ... [2025-01-09 03:55:06,915 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:06" (1/1) ... [2025-01-09 03:55:06,923 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:06" (1/1) ... [2025-01-09 03:55:06,933 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:55:06,934 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:55:06,934 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:55:06,934 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:55:06,935 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:06" (1/1) ... [2025-01-09 03:55:06,945 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:55:06,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:06,971 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:55:06,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:55:06,995 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-01-09 03:55:06,995 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-01-09 03:55:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-01-09 03:55:06,996 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-01-09 03:55:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:55:06,996 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:55:06,996 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-01-09 03:55:06,997 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-01-09 03:55:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:55:06,997 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:55:06,997 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:55:06,998 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:55:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-01-09 03:55:06,998 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-01-09 03:55:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:55:06,998 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:55:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:55:06,998 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:55:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:55:06,998 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:55:06,998 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:55:06,999 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:55:06,999 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:55:06,999 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:55:07,000 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:55:07,000 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:55:07,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:55:07,000 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:55:07,001 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:55:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-01-09 03:55:07,001 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-01-09 03:55:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:55:07,001 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:55:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:55:07,001 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:55:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:55:07,001 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:55:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:55:07,001 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:55:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:55:07,001 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:55:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:55:07,001 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:55:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:55:07,001 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:55:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:55:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:55:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:55:07,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:55:07,002 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:55:07,002 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:55:07,002 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-01-09 03:55:07,002 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-01-09 03:55:07,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:55:07,002 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:55:07,172 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:55:07,174 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:55:07,954 INFO L? ?]: Removed 478 outVars from TransFormulas that were not future-live. [2025-01-09 03:55:07,954 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:55:07,976 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:55:07,977 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:55:07,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:55:07 BoogieIcfgContainer [2025-01-09 03:55:07,977 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:55:07,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:55:07,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:55:07,983 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:55:07,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:55:06" (1/3) ... [2025-01-09 03:55:07,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8ce7c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:55:07, skipping insertion in model container [2025-01-09 03:55:07,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:55:06" (2/3) ... [2025-01-09 03:55:07,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e8ce7c4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:55:07, skipping insertion in model container [2025-01-09 03:55:07,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:55:07" (3/3) ... [2025-01-09 03:55:07,986 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec6_product20.cil.c [2025-01-09 03:55:07,997 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:55:08,000 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec6_product20.cil.c that has 25 procedures, 376 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:55:08,064 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:55:08,071 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;@2ae6f87e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:55:08,072 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:55:08,075 INFO L276 IsEmpty]: Start isEmpty. Operand has 376 states, 292 states have (on average 1.5650684931506849) internal successors, (457), 297 states have internal predecessors, (457), 58 states have call successors, (58), 24 states have call predecessors, (58), 24 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 03:55:08,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 03:55:08,090 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:08,095 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:08,095 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:08,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:08,099 INFO L85 PathProgramCache]: Analyzing trace with hash 98492324, now seen corresponding path program 1 times [2025-01-09 03:55:08,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:08,112 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369446311] [2025-01-09 03:55:08,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:08,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:08,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 03:55:08,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:55:08,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:08,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:08,747 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:55:08,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:08,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369446311] [2025-01-09 03:55:08,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369446311] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:08,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1437749779] [2025-01-09 03:55:08,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:08,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:08,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:08,752 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:55:08,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:55:08,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 03:55:09,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:55:09,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:09,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:09,043 INFO L256 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:55:09,049 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:09,087 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:55:09,090 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:09,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1437749779] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:09,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:09,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:55:09,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1340096515] [2025-01-09 03:55:09,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:09,096 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:09,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:09,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:09,112 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:55:09,114 INFO L87 Difference]: Start difference. First operand has 376 states, 292 states have (on average 1.5650684931506849) internal successors, (457), 297 states have internal predecessors, (457), 58 states have call successors, (58), 24 states have call predecessors, (58), 24 states have return successors, (58), 57 states have call predecessors, (58), 58 states have call successors, (58) Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 03:55:09,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:09,183 INFO L93 Difference]: Finished difference Result 562 states and 842 transitions. [2025-01-09 03:55:09,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:09,186 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 123 [2025-01-09 03:55:09,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:09,197 INFO L225 Difference]: With dead ends: 562 [2025-01-09 03:55:09,197 INFO L226 Difference]: Without dead ends: 371 [2025-01-09 03:55:09,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:55:09,207 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 1 mSDsluCounter, 565 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:09,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1133 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:09,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2025-01-09 03:55:09,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 370. [2025-01-09 03:55:09,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 287 states have (on average 1.5609756097560976) internal successors, (448), 291 states have internal predecessors, (448), 58 states have call successors, (58), 24 states have call predecessors, (58), 24 states have return successors, (57), 56 states have call predecessors, (57), 57 states have call successors, (57) [2025-01-09 03:55:09,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 563 transitions. [2025-01-09 03:55:09,268 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 563 transitions. Word has length 123 [2025-01-09 03:55:09,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:09,270 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 563 transitions. [2025-01-09 03:55:09,270 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 03:55:09,270 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 563 transitions. [2025-01-09 03:55:09,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 03:55:09,274 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:09,274 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:09,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 03:55:09,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 03:55:09,475 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:09,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:09,476 INFO L85 PathProgramCache]: Analyzing trace with hash 715862257, now seen corresponding path program 1 times [2025-01-09 03:55:09,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:09,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924683482] [2025-01-09 03:55:09,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:09,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:09,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:55:09,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:55:09,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:09,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:09,758 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:55:09,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:09,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924683482] [2025-01-09 03:55:09,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924683482] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:09,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291306316] [2025-01-09 03:55:09,758 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:09,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:09,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:09,761 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:55:09,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:55:09,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:55:10,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:55:10,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:10,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:10,046 INFO L256 TraceCheckSpWp]: Trace formula consists of 1132 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:55:10,055 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:10,086 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-01-09 03:55:10,089 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:10,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291306316] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:10,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:10,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:55:10,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689596684] [2025-01-09 03:55:10,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:10,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:10,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:10,091 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:10,091 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:55:10,092 INFO L87 Difference]: Start difference. First operand 370 states and 563 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 03:55:10,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:10,144 INFO L93 Difference]: Finished difference Result 788 states and 1218 transitions. [2025-01-09 03:55:10,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:10,145 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2025-01-09 03:55:10,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:10,150 INFO L225 Difference]: With dead ends: 788 [2025-01-09 03:55:10,150 INFO L226 Difference]: Without dead ends: 444 [2025-01-09 03:55:10,151 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:55:10,152 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 134 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:10,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1085 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:10,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-01-09 03:55:10,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 436. [2025-01-09 03:55:10,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 339 states have (on average 1.5811209439528024) internal successors, (536), 343 states have internal predecessors, (536), 72 states have call successors, (72), 24 states have call predecessors, (72), 24 states have return successors, (71), 70 states have call predecessors, (71), 71 states have call successors, (71) [2025-01-09 03:55:10,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 679 transitions. [2025-01-09 03:55:10,190 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 679 transitions. Word has length 131 [2025-01-09 03:55:10,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:10,191 INFO L471 AbstractCegarLoop]: Abstraction has 436 states and 679 transitions. [2025-01-09 03:55:10,192 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, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 03:55:10,193 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 679 transitions. [2025-01-09 03:55:10,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 03:55:10,197 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:10,197 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:10,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:55:10,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:10,398 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:10,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:10,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1400366206, now seen corresponding path program 1 times [2025-01-09 03:55:10,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:10,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222332789] [2025-01-09 03:55:10,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:10,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:10,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 03:55:10,426 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 03:55:10,426 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:10,426 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:10,590 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:55:10,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:10,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222332789] [2025-01-09 03:55:10,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222332789] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:10,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448376234] [2025-01-09 03:55:10,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:10,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:10,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:10,595 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:55:10,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:55:10,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 03:55:10,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 03:55:10,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:10,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:10,857 INFO L256 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:55:10,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:10,917 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 03:55:10,918 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:10,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448376234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:10,918 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:10,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:55:10,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882124354] [2025-01-09 03:55:10,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:10,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:55:10,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:10,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:55:10,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:55:10,920 INFO L87 Difference]: Start difference. First operand 436 states and 679 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 03:55:10,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:10,987 INFO L93 Difference]: Finished difference Result 863 states and 1348 transitions. [2025-01-09 03:55:10,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:55:10,987 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 132 [2025-01-09 03:55:10,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:10,991 INFO L225 Difference]: With dead ends: 863 [2025-01-09 03:55:10,991 INFO L226 Difference]: Without dead ends: 438 [2025-01-09 03:55:10,992 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:55:10,993 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 2 mSDsluCounter, 1651 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2205 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:10,993 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2205 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:10,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2025-01-09 03:55:11,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2025-01-09 03:55:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 438 states, 340 states have (on average 1.5794117647058823) internal successors, (537), 345 states have internal predecessors, (537), 72 states have call successors, (72), 24 states have call predecessors, (72), 25 states have return successors, (73), 70 states have call predecessors, (73), 71 states have call successors, (73) [2025-01-09 03:55:11,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 682 transitions. [2025-01-09 03:55:11,019 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 682 transitions. Word has length 132 [2025-01-09 03:55:11,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:11,019 INFO L471 AbstractCegarLoop]: Abstraction has 438 states and 682 transitions. [2025-01-09 03:55:11,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 03:55:11,020 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 682 transitions. [2025-01-09 03:55:11,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 03:55:11,025 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:11,026 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:11,034 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:55:11,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:11,230 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:11,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:11,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1925852407, now seen corresponding path program 1 times [2025-01-09 03:55:11,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:11,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381094740] [2025-01-09 03:55:11,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:11,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:11,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 03:55:11,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 03:55:11,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:11,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:11,443 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 03:55:11,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:11,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381094740] [2025-01-09 03:55:11,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381094740] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:11,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1231624977] [2025-01-09 03:55:11,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:11,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:11,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:11,446 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:55:11,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:55:11,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 03:55:11,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 03:55:11,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:11,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:11,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 1216 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:55:11,686 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:11,725 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:55:11,725 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:55:11,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1231624977] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:11,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:55:11,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:55:11,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [465773262] [2025-01-09 03:55:11,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:11,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:55:11,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:11,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:55:11,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:55:11,729 INFO L87 Difference]: Start difference. First operand 438 states and 682 transitions. Second operand has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 03:55:11,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:11,797 INFO L93 Difference]: Finished difference Result 865 states and 1353 transitions. [2025-01-09 03:55:11,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:55:11,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 152 [2025-01-09 03:55:11,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:11,801 INFO L225 Difference]: With dead ends: 865 [2025-01-09 03:55:11,801 INFO L226 Difference]: Without dead ends: 440 [2025-01-09 03:55:11,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 150 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-01-09 03:55:11,803 INFO L435 NwaCegarLoop]: 552 mSDtfsCounter, 2 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2191 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:11,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2191 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:11,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-01-09 03:55:11,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2025-01-09 03:55:11,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 341 states have (on average 1.5777126099706744) internal successors, (538), 347 states have internal predecessors, (538), 72 states have call successors, (72), 24 states have call predecessors, (72), 26 states have return successors, (78), 70 states have call predecessors, (78), 71 states have call successors, (78) [2025-01-09 03:55:11,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 688 transitions. [2025-01-09 03:55:11,819 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 688 transitions. Word has length 152 [2025-01-09 03:55:11,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:11,819 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 688 transitions. [2025-01-09 03:55:11,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 19.4) internal successors, (97), 5 states have internal predecessors, (97), 3 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 03:55:11,820 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 688 transitions. [2025-01-09 03:55:11,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 03:55:11,822 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:11,822 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:11,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:55:12,022 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:12,023 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:12,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:12,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1432293137, now seen corresponding path program 1 times [2025-01-09 03:55:12,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:12,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459288782] [2025-01-09 03:55:12,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:12,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:12,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 03:55:12,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 03:55:12,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:12,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:12,165 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-01-09 03:55:12,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:12,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459288782] [2025-01-09 03:55:12,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459288782] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:12,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:12,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:55:12,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977787753] [2025-01-09 03:55:12,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:12,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:55:12,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:12,167 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:55:12,167 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:12,167 INFO L87 Difference]: Start difference. First operand 440 states and 688 transitions. Second operand has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 03:55:12,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:12,222 INFO L93 Difference]: Finished difference Result 857 states and 1344 transitions. [2025-01-09 03:55:12,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:55:12,223 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-01-09 03:55:12,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:12,225 INFO L225 Difference]: With dead ends: 857 [2025-01-09 03:55:12,225 INFO L226 Difference]: Without dead ends: 440 [2025-01-09 03:55:12,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:12,227 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 2 mSDsluCounter, 1654 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2209 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:12,227 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2209 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:12,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-01-09 03:55:12,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 440. [2025-01-09 03:55:12,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 341 states have (on average 1.5777126099706744) internal successors, (538), 347 states have internal predecessors, (538), 72 states have call successors, (72), 24 states have call predecessors, (72), 26 states have return successors, (77), 70 states have call predecessors, (77), 71 states have call successors, (77) [2025-01-09 03:55:12,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 687 transitions. [2025-01-09 03:55:12,251 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 687 transitions. Word has length 153 [2025-01-09 03:55:12,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:12,252 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 687 transitions. [2025-01-09 03:55:12,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 23.25) internal successors, (93), 5 states have internal predecessors, (93), 3 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (19), 2 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 03:55:12,252 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 687 transitions. [2025-01-09 03:55:12,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-01-09 03:55:12,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:12,254 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:12,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:55:12,254 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:12,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:12,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2108706550, now seen corresponding path program 1 times [2025-01-09 03:55:12,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:12,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048993137] [2025-01-09 03:55:12,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:12,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:12,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-01-09 03:55:12,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-01-09 03:55:12,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:12,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:12,378 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:55:12,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:12,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048993137] [2025-01-09 03:55:12,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048993137] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:12,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:12,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:55:12,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924681440] [2025-01-09 03:55:12,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:12,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:55:12,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:12,383 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:55:12,383 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:12,383 INFO L87 Difference]: Start difference. First operand 440 states and 687 transitions. Second operand has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 03:55:12,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:12,427 INFO L93 Difference]: Finished difference Result 859 states and 1347 transitions. [2025-01-09 03:55:12,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:55:12,428 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) Word has length 135 [2025-01-09 03:55:12,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:12,431 INFO L225 Difference]: With dead ends: 859 [2025-01-09 03:55:12,431 INFO L226 Difference]: Without dead ends: 442 [2025-01-09 03:55:12,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:55:12,433 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1 mSDsluCounter, 1656 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2212 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:12,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2212 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:12,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-01-09 03:55:12,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-01-09 03:55:12,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 342 states have (on average 1.5760233918128654) internal successors, (539), 349 states have internal predecessors, (539), 72 states have call successors, (72), 24 states have call predecessors, (72), 27 states have return successors, (79), 70 states have call predecessors, (79), 71 states have call successors, (79) [2025-01-09 03:55:12,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 690 transitions. [2025-01-09 03:55:12,459 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 690 transitions. Word has length 135 [2025-01-09 03:55:12,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:12,463 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 690 transitions. [2025-01-09 03:55:12,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.75) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (16), 2 states have call predecessors, (16), 3 states have call successors, (16) [2025-01-09 03:55:12,463 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 690 transitions. [2025-01-09 03:55:12,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 03:55:12,465 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:12,465 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:12,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:55:12,465 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:12,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:12,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1406261460, now seen corresponding path program 1 times [2025-01-09 03:55:12,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:12,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994764185] [2025-01-09 03:55:12,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:12,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:12,499 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 03:55:12,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 03:55:12,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:12,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:12,621 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-01-09 03:55:12,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:12,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994764185] [2025-01-09 03:55:12,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994764185] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:12,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:12,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:55:12,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493556199] [2025-01-09 03:55:12,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:12,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:55:12,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:12,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:55:12,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:55:12,623 INFO L87 Difference]: Start difference. First operand 442 states and 690 transitions. Second operand has 8 states, 7 states have (on average 14.0) internal successors, (98), 8 states have internal predecessors, (98), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 03:55:12,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:12,735 INFO L93 Difference]: Finished difference Result 861 states and 1346 transitions. [2025-01-09 03:55:12,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:55:12,736 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 14.0) internal successors, (98), 8 states have internal predecessors, (98), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2025-01-09 03:55:12,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:12,739 INFO L225 Difference]: With dead ends: 861 [2025-01-09 03:55:12,739 INFO L226 Difference]: Without dead ends: 444 [2025-01-09 03:55:12,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:55:12,741 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 7 mSDsluCounter, 3247 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3793 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:12,742 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3793 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:55:12,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-01-09 03:55:12,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-01-09 03:55:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 344 states have (on average 1.572674418604651) internal successors, (541), 350 states have internal predecessors, (541), 72 states have call successors, (72), 25 states have call predecessors, (72), 27 states have return successors, (78), 70 states have call predecessors, (78), 71 states have call successors, (78) [2025-01-09 03:55:12,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 691 transitions. [2025-01-09 03:55:12,758 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 691 transitions. Word has length 155 [2025-01-09 03:55:12,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:12,758 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 691 transitions. [2025-01-09 03:55:12,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 14.0) internal successors, (98), 8 states have internal predecessors, (98), 4 states have call successors, (22), 2 states have call predecessors, (22), 3 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 03:55:12,759 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 691 transitions. [2025-01-09 03:55:12,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-01-09 03:55:12,761 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:12,761 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:12,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:55:12,761 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:12,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:12,762 INFO L85 PathProgramCache]: Analyzing trace with hash -2100768276, now seen corresponding path program 1 times [2025-01-09 03:55:12,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:12,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218971759] [2025-01-09 03:55:12,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:12,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:12,778 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-01-09 03:55:12,808 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-01-09 03:55:12,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:12,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:55:12,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:12,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218971759] [2025-01-09 03:55:12,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218971759] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:12,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:12,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:55:12,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709069940] [2025-01-09 03:55:12,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:12,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:55:12,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:12,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:55:12,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:55:12,943 INFO L87 Difference]: Start difference. First operand 444 states and 691 transitions. Second operand has 8 states, 7 states have (on average 13.142857142857142) internal successors, (92), 8 states have internal predecessors, (92), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 03:55:13,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:13,072 INFO L93 Difference]: Finished difference Result 864 states and 1353 transitions. [2025-01-09 03:55:13,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:55:13,072 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.142857142857142) internal successors, (92), 8 states have internal predecessors, (92), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) Word has length 137 [2025-01-09 03:55:13,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:13,076 INFO L225 Difference]: With dead ends: 864 [2025-01-09 03:55:13,076 INFO L226 Difference]: Without dead ends: 447 [2025-01-09 03:55:13,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:55:13,078 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 5 mSDsluCounter, 3259 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3807 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:13,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3807 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:55:13,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2025-01-09 03:55:13,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2025-01-09 03:55:13,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 346 states have (on average 1.569364161849711) internal successors, (543), 353 states have internal predecessors, (543), 72 states have call successors, (72), 25 states have call predecessors, (72), 28 states have return successors, (83), 70 states have call predecessors, (83), 71 states have call successors, (83) [2025-01-09 03:55:13,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 698 transitions. [2025-01-09 03:55:13,095 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 698 transitions. Word has length 137 [2025-01-09 03:55:13,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:13,095 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 698 transitions. [2025-01-09 03:55:13,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.142857142857142) internal successors, (92), 8 states have internal predecessors, (92), 4 states have call successors, (19), 2 states have call predecessors, (19), 3 states have return successors, (16), 3 states have call predecessors, (16), 4 states have call successors, (16) [2025-01-09 03:55:13,096 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 698 transitions. [2025-01-09 03:55:13,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-01-09 03:55:13,098 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:13,098 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:13,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:55:13,098 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:13,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:13,099 INFO L85 PathProgramCache]: Analyzing trace with hash -843142995, now seen corresponding path program 1 times [2025-01-09 03:55:13,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:13,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [51473706] [2025-01-09 03:55:13,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:13,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:13,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 03:55:13,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 03:55:13,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:13,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:13,248 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-01-09 03:55:13,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:13,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [51473706] [2025-01-09 03:55:13,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [51473706] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:55:13,248 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [54822581] [2025-01-09 03:55:13,248 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:13,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:13,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:55:13,251 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:55:13,252 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:55:13,388 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-01-09 03:55:13,483 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-01-09 03:55:13,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:13,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:13,488 INFO L256 TraceCheckSpWp]: Trace formula consists of 1143 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:55:13,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:55:13,536 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:13,537 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:55:13,668 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:13,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [54822581] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:55:13,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:55:13,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-01-09 03:55:13,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875263198] [2025-01-09 03:55:13,669 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:55:13,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:55:13,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:13,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:55:13,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:55:13,671 INFO L87 Difference]: Start difference. First operand 447 states and 698 transitions. Second operand has 11 states, 10 states have (on average 14.2) internal successors, (142), 11 states have internal predecessors, (142), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) [2025-01-09 03:55:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:14,254 INFO L93 Difference]: Finished difference Result 1301 states and 2123 transitions. [2025-01-09 03:55:14,254 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:55:14,254 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 14.2) internal successors, (142), 11 states have internal predecessors, (142), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) Word has length 138 [2025-01-09 03:55:14,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:14,261 INFO L225 Difference]: With dead ends: 1301 [2025-01-09 03:55:14,261 INFO L226 Difference]: Without dead ends: 885 [2025-01-09 03:55:14,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-01-09 03:55:14,266 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 1381 mSDsluCounter, 3403 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1381 SdHoareTripleChecker+Valid, 3959 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:14,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1381 Valid, 3959 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:55:14,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2025-01-09 03:55:14,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 861. [2025-01-09 03:55:14,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 861 states, 681 states have (on average 1.6226138032305433) internal successors, (1105), 687 states have internal predecessors, (1105), 151 states have call successors, (151), 26 states have call predecessors, (151), 28 states have return successors, (172), 149 states have call predecessors, (172), 150 states have call successors, (172) [2025-01-09 03:55:14,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 861 states to 861 states and 1428 transitions. [2025-01-09 03:55:14,309 INFO L78 Accepts]: Start accepts. Automaton has 861 states and 1428 transitions. Word has length 138 [2025-01-09 03:55:14,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:14,310 INFO L471 AbstractCegarLoop]: Abstraction has 861 states and 1428 transitions. [2025-01-09 03:55:14,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 14.2) internal successors, (142), 11 states have internal predecessors, (142), 4 states have call successors, (33), 2 states have call predecessors, (33), 3 states have return successors, (30), 3 states have call predecessors, (30), 4 states have call successors, (30) [2025-01-09 03:55:14,311 INFO L276 IsEmpty]: Start isEmpty. Operand 861 states and 1428 transitions. [2025-01-09 03:55:14,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-01-09 03:55:14,315 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:14,315 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:14,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:55:14,516 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:55:14,516 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:14,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:14,517 INFO L85 PathProgramCache]: Analyzing trace with hash -550907898, now seen corresponding path program 1 times [2025-01-09 03:55:14,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:14,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729629267] [2025-01-09 03:55:14,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:14,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:14,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-01-09 03:55:14,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-01-09 03:55:14,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:14,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:14,585 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:14,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:14,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729629267] [2025-01-09 03:55:14,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729629267] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:14,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:14,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:14,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818892805] [2025-01-09 03:55:14,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:14,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:14,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:14,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:14,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:14,587 INFO L87 Difference]: Start difference. First operand 861 states and 1428 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 03:55:14,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:14,628 INFO L93 Difference]: Finished difference Result 2032 states and 3429 transitions. [2025-01-09 03:55:14,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:14,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 142 [2025-01-09 03:55:14,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:14,636 INFO L225 Difference]: With dead ends: 2032 [2025-01-09 03:55:14,636 INFO L226 Difference]: Without dead ends: 1252 [2025-01-09 03:55:14,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:14,640 INFO L435 NwaCegarLoop]: 571 mSDtfsCounter, 131 mSDsluCounter, 550 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1121 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:14,640 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1121 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:14,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2025-01-09 03:55:14,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1244. [2025-01-09 03:55:14,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1244 states, 985 states have (on average 1.6426395939086293) internal successors, (1618), 991 states have internal predecessors, (1618), 230 states have call successors, (230), 26 states have call predecessors, (230), 28 states have return successors, (261), 228 states have call predecessors, (261), 229 states have call successors, (261) [2025-01-09 03:55:14,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1244 states to 1244 states and 2109 transitions. [2025-01-09 03:55:14,693 INFO L78 Accepts]: Start accepts. Automaton has 1244 states and 2109 transitions. Word has length 142 [2025-01-09 03:55:14,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:14,693 INFO L471 AbstractCegarLoop]: Abstraction has 1244 states and 2109 transitions. [2025-01-09 03:55:14,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 03:55:14,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1244 states and 2109 transitions. [2025-01-09 03:55:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 03:55:14,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:14,702 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:14,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:55:14,702 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:14,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:14,703 INFO L85 PathProgramCache]: Analyzing trace with hash -502260088, now seen corresponding path program 1 times [2025-01-09 03:55:14,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:14,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086297082] [2025-01-09 03:55:14,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:14,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:14,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 03:55:14,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 03:55:14,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:14,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:14,797 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 03:55:14,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:14,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086297082] [2025-01-09 03:55:14,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086297082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:14,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:14,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:14,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830675918] [2025-01-09 03:55:14,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:14,797 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:14,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:14,798 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:14,798 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:14,798 INFO L87 Difference]: Start difference. First operand 1244 states and 2109 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:55:14,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:14,870 INFO L93 Difference]: Finished difference Result 2989 states and 5105 transitions. [2025-01-09 03:55:14,871 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:14,871 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 162 [2025-01-09 03:55:14,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:14,886 INFO L225 Difference]: With dead ends: 2989 [2025-01-09 03:55:14,886 INFO L226 Difference]: Without dead ends: 1877 [2025-01-09 03:55:14,893 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:14,895 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 129 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:14,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1114 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:14,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1877 states. [2025-01-09 03:55:14,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1877 to 1869. [2025-01-09 03:55:14,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1491 states have (on average 1.6525821596244132) internal successors, (2464), 1497 states have internal predecessors, (2464), 349 states have call successors, (349), 26 states have call predecessors, (349), 28 states have return successors, (380), 347 states have call predecessors, (380), 348 states have call successors, (380) [2025-01-09 03:55:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 3193 transitions. [2025-01-09 03:55:15,001 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 3193 transitions. Word has length 162 [2025-01-09 03:55:15,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:15,001 INFO L471 AbstractCegarLoop]: Abstraction has 1869 states and 3193 transitions. [2025-01-09 03:55:15,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:55:15,002 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 3193 transitions. [2025-01-09 03:55:15,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-01-09 03:55:15,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:15,012 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:15,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:55:15,013 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:15,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:15,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1755240236, now seen corresponding path program 1 times [2025-01-09 03:55:15,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:15,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1984719815] [2025-01-09 03:55:15,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:15,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:15,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-01-09 03:55:15,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-01-09 03:55:15,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:15,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:15,086 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:15,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:15,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1984719815] [2025-01-09 03:55:15,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1984719815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:15,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:15,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:15,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682442828] [2025-01-09 03:55:15,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:15,088 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:15,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:15,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:15,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:15,088 INFO L87 Difference]: Start difference. First operand 1869 states and 3193 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 03:55:15,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:15,169 INFO L93 Difference]: Finished difference Result 4441 states and 7654 transitions. [2025-01-09 03:55:15,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:15,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 144 [2025-01-09 03:55:15,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:15,185 INFO L225 Difference]: With dead ends: 4441 [2025-01-09 03:55:15,185 INFO L226 Difference]: Without dead ends: 2835 [2025-01-09 03:55:15,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:15,193 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 127 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:15,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:15,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2835 states. [2025-01-09 03:55:15,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2835 to 2827. [2025-01-09 03:55:15,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2827 states, 2287 states have (on average 1.6606908613904678) internal successors, (3798), 2293 states have internal predecessors, (3798), 511 states have call successors, (511), 26 states have call predecessors, (511), 28 states have return successors, (558), 509 states have call predecessors, (558), 510 states have call successors, (558) [2025-01-09 03:55:15,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 4867 transitions. [2025-01-09 03:55:15,312 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 4867 transitions. Word has length 144 [2025-01-09 03:55:15,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:15,312 INFO L471 AbstractCegarLoop]: Abstraction has 2827 states and 4867 transitions. [2025-01-09 03:55:15,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 03:55:15,313 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 4867 transitions. [2025-01-09 03:55:15,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 03:55:15,326 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:15,327 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:15,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:55:15,327 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:15,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:15,327 INFO L85 PathProgramCache]: Analyzing trace with hash 128343103, now seen corresponding path program 1 times [2025-01-09 03:55:15,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:15,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1306394151] [2025-01-09 03:55:15,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:15,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:15,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 03:55:15,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 03:55:15,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:15,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:15,402 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:15,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:15,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1306394151] [2025-01-09 03:55:15,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1306394151] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:15,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:15,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:15,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284699869] [2025-01-09 03:55:15,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:15,404 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:15,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:15,404 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:15,405 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:15,406 INFO L87 Difference]: Start difference. First operand 2827 states and 4867 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 03:55:15,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:15,512 INFO L93 Difference]: Finished difference Result 6734 states and 11686 transitions. [2025-01-09 03:55:15,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:15,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 145 [2025-01-09 03:55:15,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:15,537 INFO L225 Difference]: With dead ends: 6734 [2025-01-09 03:55:15,537 INFO L226 Difference]: Without dead ends: 4382 [2025-01-09 03:55:15,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:15,547 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 125 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1111 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:15,547 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1111 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:15,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4382 states. [2025-01-09 03:55:15,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4382 to 4374. [2025-01-09 03:55:15,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4374 states, 3589 states have (on average 1.6664809139035943) internal successors, (5981), 3595 states have internal predecessors, (5981), 756 states have call successors, (756), 26 states have call predecessors, (756), 28 states have return successors, (829), 754 states have call predecessors, (829), 755 states have call successors, (829) [2025-01-09 03:55:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4374 states to 4374 states and 7566 transitions. [2025-01-09 03:55:15,756 INFO L78 Accepts]: Start accepts. Automaton has 4374 states and 7566 transitions. Word has length 145 [2025-01-09 03:55:15,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:15,757 INFO L471 AbstractCegarLoop]: Abstraction has 4374 states and 7566 transitions. [2025-01-09 03:55:15,757 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 03:55:15,757 INFO L276 IsEmpty]: Start isEmpty. Operand 4374 states and 7566 transitions. [2025-01-09 03:55:15,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2025-01-09 03:55:15,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:15,776 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:15,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:55:15,777 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:15,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:15,777 INFO L85 PathProgramCache]: Analyzing trace with hash 299300886, now seen corresponding path program 1 times [2025-01-09 03:55:15,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:15,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052698333] [2025-01-09 03:55:15,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:15,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:15,795 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 165 statements into 1 equivalence classes. [2025-01-09 03:55:15,801 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 165 of 165 statements. [2025-01-09 03:55:15,801 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:15,801 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:15,854 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 03:55:15,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:15,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052698333] [2025-01-09 03:55:15,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052698333] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:15,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:15,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:15,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337940023] [2025-01-09 03:55:15,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:15,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:15,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:15,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:15,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:15,855 INFO L87 Difference]: Start difference. First operand 4374 states and 7566 transitions. Second operand has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:55:16,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:16,030 INFO L93 Difference]: Finished difference Result 10828 states and 18838 transitions. [2025-01-09 03:55:16,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:16,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 165 [2025-01-09 03:55:16,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:16,075 INFO L225 Difference]: With dead ends: 10828 [2025-01-09 03:55:16,076 INFO L226 Difference]: Without dead ends: 7170 [2025-01-09 03:55:16,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:16,092 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 123 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1138 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:16,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1138 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:16,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7170 states. [2025-01-09 03:55:16,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7170 to 7162. [2025-01-09 03:55:16,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7162 states, 5884 states have (on average 1.6629843643779743) internal successors, (9785), 5890 states have internal predecessors, (9785), 1249 states have call successors, (1249), 26 states have call predecessors, (1249), 28 states have return successors, (1366), 1247 states have call predecessors, (1366), 1248 states have call successors, (1366) [2025-01-09 03:55:16,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7162 states to 7162 states and 12400 transitions. [2025-01-09 03:55:16,476 INFO L78 Accepts]: Start accepts. Automaton has 7162 states and 12400 transitions. Word has length 165 [2025-01-09 03:55:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:16,477 INFO L471 AbstractCegarLoop]: Abstraction has 7162 states and 12400 transitions. [2025-01-09 03:55:16,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 3 states have internal predecessors, (102), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:55:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 7162 states and 12400 transitions. [2025-01-09 03:55:16,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2025-01-09 03:55:16,507 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:16,508 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:16,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:55:16,508 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:16,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:16,508 INFO L85 PathProgramCache]: Analyzing trace with hash -1495838013, now seen corresponding path program 1 times [2025-01-09 03:55:16,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:16,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125999982] [2025-01-09 03:55:16,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:16,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:16,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 166 statements into 1 equivalence classes. [2025-01-09 03:55:16,534 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 166 of 166 statements. [2025-01-09 03:55:16,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:16,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:16,566 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 03:55:16,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:16,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125999982] [2025-01-09 03:55:16,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125999982] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:16,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:16,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:16,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291181406] [2025-01-09 03:55:16,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:16,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:16,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:16,569 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:16,569 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:16,569 INFO L87 Difference]: Start difference. First operand 7162 states and 12400 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:55:16,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:16,906 INFO L93 Difference]: Finished difference Result 18115 states and 31558 transitions. [2025-01-09 03:55:16,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:16,906 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 166 [2025-01-09 03:55:16,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:16,964 INFO L225 Difference]: With dead ends: 18115 [2025-01-09 03:55:16,965 INFO L226 Difference]: Without dead ends: 12055 [2025-01-09 03:55:16,993 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:16,994 INFO L435 NwaCegarLoop]: 569 mSDtfsCounter, 121 mSDsluCounter, 555 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1124 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:16,994 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1124 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:17,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12055 states. [2025-01-09 03:55:17,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12055 to 12047. [2025-01-09 03:55:17,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12047 states, 9947 states have (on average 1.6630139740625314) internal successors, (16542), 9953 states have internal predecessors, (16542), 2071 states have call successors, (2071), 26 states have call predecessors, (2071), 28 states have return successors, (2266), 2069 states have call predecessors, (2266), 2070 states have call successors, (2266) [2025-01-09 03:55:17,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12047 states to 12047 states and 20879 transitions. [2025-01-09 03:55:17,488 INFO L78 Accepts]: Start accepts. Automaton has 12047 states and 20879 transitions. Word has length 166 [2025-01-09 03:55:17,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:17,490 INFO L471 AbstractCegarLoop]: Abstraction has 12047 states and 20879 transitions. [2025-01-09 03:55:17,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:55:17,490 INFO L276 IsEmpty]: Start isEmpty. Operand 12047 states and 20879 transitions. [2025-01-09 03:55:17,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2025-01-09 03:55:17,527 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:17,527 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:17,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:55:17,528 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:17,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:17,528 INFO L85 PathProgramCache]: Analyzing trace with hash 633366036, now seen corresponding path program 1 times [2025-01-09 03:55:17,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:17,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773305196] [2025-01-09 03:55:17,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:17,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:17,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 167 statements into 1 equivalence classes. [2025-01-09 03:55:17,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 167 of 167 statements. [2025-01-09 03:55:17,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:17,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:17,585 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 03:55:17,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:17,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773305196] [2025-01-09 03:55:17,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773305196] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:17,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:17,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:17,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245940346] [2025-01-09 03:55:17,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:17,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:17,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:17,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:17,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:17,587 INFO L87 Difference]: Start difference. First operand 12047 states and 20879 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:55:17,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:17,977 INFO L93 Difference]: Finished difference Result 28835 states and 49899 transitions. [2025-01-09 03:55:17,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:17,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 167 [2025-01-09 03:55:17,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:18,053 INFO L225 Difference]: With dead ends: 28835 [2025-01-09 03:55:18,053 INFO L226 Difference]: Without dead ends: 18842 [2025-01-09 03:55:18,094 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:18,096 INFO L435 NwaCegarLoop]: 567 mSDtfsCounter, 119 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 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-01-09 03:55:18,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1094 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:18,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18842 states. [2025-01-09 03:55:18,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18842 to 18834. [2025-01-09 03:55:18,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18834 states, 15531 states have (on average 1.6384006181186015) internal successors, (25446), 15537 states have internal predecessors, (25446), 3274 states have call successors, (3274), 26 states have call predecessors, (3274), 28 states have return successors, (3613), 3272 states have call predecessors, (3613), 3273 states have call successors, (3613) [2025-01-09 03:55:18,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18834 states to 18834 states and 32333 transitions. [2025-01-09 03:55:18,894 INFO L78 Accepts]: Start accepts. Automaton has 18834 states and 32333 transitions. Word has length 167 [2025-01-09 03:55:18,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:18,894 INFO L471 AbstractCegarLoop]: Abstraction has 18834 states and 32333 transitions. [2025-01-09 03:55:18,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (22), 2 states have call predecessors, (22), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:55:18,894 INFO L276 IsEmpty]: Start isEmpty. Operand 18834 states and 32333 transitions. [2025-01-09 03:55:18,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 03:55:18,932 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:18,933 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:18,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:55:18,933 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:18,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:18,933 INFO L85 PathProgramCache]: Analyzing trace with hash 1402306436, now seen corresponding path program 1 times [2025-01-09 03:55:18,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:18,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044402799] [2025-01-09 03:55:18,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:18,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:18,952 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 03:55:18,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 03:55:18,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:18,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:19,000 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:19,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:19,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044402799] [2025-01-09 03:55:19,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044402799] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:19,001 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:19,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:19,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692427447] [2025-01-09 03:55:19,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:19,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:19,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:19,002 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:19,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:19,003 INFO L87 Difference]: Start difference. First operand 18834 states and 32333 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 03:55:19,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:19,929 INFO L93 Difference]: Finished difference Result 49827 states and 85837 transitions. [2025-01-09 03:55:19,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:19,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 149 [2025-01-09 03:55:19,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:20,071 INFO L225 Difference]: With dead ends: 49827 [2025-01-09 03:55:20,072 INFO L226 Difference]: Without dead ends: 33660 [2025-01-09 03:55:20,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:20,115 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 117 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:20,115 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1114 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:20,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33660 states. [2025-01-09 03:55:21,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33660 to 33652. [2025-01-09 03:55:21,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33652 states, 27899 states have (on average 1.6347897774113767) internal successors, (45609), 27905 states have internal predecessors, (45609), 5724 states have call successors, (5724), 26 states have call predecessors, (5724), 28 states have return successors, (6337), 5722 states have call predecessors, (6337), 5723 states have call successors, (6337) [2025-01-09 03:55:21,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33652 states to 33652 states and 57670 transitions. [2025-01-09 03:55:21,315 INFO L78 Accepts]: Start accepts. Automaton has 33652 states and 57670 transitions. Word has length 149 [2025-01-09 03:55:21,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:21,315 INFO L471 AbstractCegarLoop]: Abstraction has 33652 states and 57670 transitions. [2025-01-09 03:55:21,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 03:55:21,316 INFO L276 IsEmpty]: Start isEmpty. Operand 33652 states and 57670 transitions. [2025-01-09 03:55:21,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 03:55:21,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:21,367 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:21,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:55:21,367 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:21,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:21,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1847276, now seen corresponding path program 1 times [2025-01-09 03:55:21,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:21,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208000449] [2025-01-09 03:55:21,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:21,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:21,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 03:55:21,394 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 03:55:21,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:21,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:21,426 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:21,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:21,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208000449] [2025-01-09 03:55:21,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208000449] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:21,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:21,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:21,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351241835] [2025-01-09 03:55:21,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:21,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:21,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:21,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:21,429 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:21,429 INFO L87 Difference]: Start difference. First operand 33652 states and 57670 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 03:55:22,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:22,891 INFO L93 Difference]: Finished difference Result 91864 states and 157869 transitions. [2025-01-09 03:55:22,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:22,891 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 150 [2025-01-09 03:55:22,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:23,189 INFO L225 Difference]: With dead ends: 91864 [2025-01-09 03:55:23,189 INFO L226 Difference]: Without dead ends: 61758 [2025-01-09 03:55:23,293 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:23,294 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 115 mSDsluCounter, 554 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1118 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:23,294 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1118 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:23,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61758 states. [2025-01-09 03:55:25,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61758 to 61750. [2025-01-09 03:55:25,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61750 states, 51484 states have (on average 1.630118094942118) internal successors, (83925), 51490 states have internal predecessors, (83925), 10237 states have call successors, (10237), 26 states have call predecessors, (10237), 28 states have return successors, (11382), 10235 states have call predecessors, (11382), 10236 states have call successors, (11382) [2025-01-09 03:55:25,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61750 states to 61750 states and 105544 transitions. [2025-01-09 03:55:25,529 INFO L78 Accepts]: Start accepts. Automaton has 61750 states and 105544 transitions. Word has length 150 [2025-01-09 03:55:25,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:25,530 INFO L471 AbstractCegarLoop]: Abstraction has 61750 states and 105544 transitions. [2025-01-09 03:55:25,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 03:55:25,530 INFO L276 IsEmpty]: Start isEmpty. Operand 61750 states and 105544 transitions. [2025-01-09 03:55:25,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 03:55:25,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:25,601 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:25,601 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:55:25,602 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:25,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:25,602 INFO L85 PathProgramCache]: Analyzing trace with hash 347075300, now seen corresponding path program 1 times [2025-01-09 03:55:25,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:25,602 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738042] [2025-01-09 03:55:25,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:25,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:25,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 03:55:25,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 03:55:25,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:25,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:25,668 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-09 03:55:25,668 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:25,668 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738042] [2025-01-09 03:55:25,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738042] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:25,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:25,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:55:25,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598550207] [2025-01-09 03:55:25,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:25,670 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:55:25,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:25,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:55:25,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:25,670 INFO L87 Difference]: Start difference. First operand 61750 states and 105544 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 03:55:28,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:28,244 INFO L93 Difference]: Finished difference Result 115721 states and 198158 transitions. [2025-01-09 03:55:28,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:55:28,245 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 151 [2025-01-09 03:55:28,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:28,842 INFO L225 Difference]: With dead ends: 115721 [2025-01-09 03:55:28,842 INFO L226 Difference]: Without dead ends: 115543 [2025-01-09 03:55:28,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:55:28,920 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 110 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:28,920 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1120 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:55:29,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115543 states. [2025-01-09 03:55:32,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115543 to 115535. [2025-01-09 03:55:32,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115535 states, 96901 states have (on average 1.6243898411781097) internal successors, (157405), 96907 states have internal predecessors, (157405), 18605 states have call successors, (18605), 26 states have call predecessors, (18605), 28 states have return successors, (20796), 18603 states have call predecessors, (20796), 18604 states have call successors, (20796) [2025-01-09 03:55:33,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115535 states to 115535 states and 196806 transitions. [2025-01-09 03:55:33,319 INFO L78 Accepts]: Start accepts. Automaton has 115535 states and 196806 transitions. Word has length 151 [2025-01-09 03:55:33,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:55:33,319 INFO L471 AbstractCegarLoop]: Abstraction has 115535 states and 196806 transitions. [2025-01-09 03:55:33,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2025-01-09 03:55:33,320 INFO L276 IsEmpty]: Start isEmpty. Operand 115535 states and 196806 transitions. [2025-01-09 03:55:33,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2025-01-09 03:55:33,411 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:55:33,411 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:55:33,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:55:33,412 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:55:33,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:55:33,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1832193243, now seen corresponding path program 1 times [2025-01-09 03:55:33,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:55:33,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [959220704] [2025-01-09 03:55:33,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:55:33,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:55:33,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 171 statements into 1 equivalence classes. [2025-01-09 03:55:33,442 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 171 of 171 statements. [2025-01-09 03:55:33,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:55:33,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:55:33,567 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-01-09 03:55:33,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:55:33,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [959220704] [2025-01-09 03:55:33,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [959220704] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:55:33,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:55:33,568 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:55:33,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386499773] [2025-01-09 03:55:33,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:55:33,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:55:33,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:55:33,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:55:33,571 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:55:33,571 INFO L87 Difference]: Start difference. First operand 115535 states and 196806 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 5 states have internal predecessors, (108), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 03:55:38,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:55:38,041 INFO L93 Difference]: Finished difference Result 222313 states and 380217 transitions. [2025-01-09 03:55:38,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:55:38,042 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 5 states have internal predecessors, (108), 2 states have call successors, (22), 3 states have call predecessors, (22), 2 states have return successors, (19), 3 states have call predecessors, (19), 2 states have call successors, (19) Word has length 171 [2025-01-09 03:55:38,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:55:39,005 INFO L225 Difference]: With dead ends: 222313 [2025-01-09 03:55:39,005 INFO L226 Difference]: Without dead ends: 222143 [2025-01-09 03:55:39,097 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:55:39,097 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 511 mSDsluCounter, 2257 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 512 SdHoareTripleChecker+Valid, 2875 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:55:39,097 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [512 Valid, 2875 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:55:39,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222143 states.