./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product40.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec0_product40.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b2243f2ebf184fce0ef7b08cdc971efef96ae919ab8c33e807ab93ab6dbfb0b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:20:13,607 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:20:13,658 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:20:13,665 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:20:13,665 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:20:13,686 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:20:13,687 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:20:13,687 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:20:13,687 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:20:13,687 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:20:13,688 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:20:13,688 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:20:13,688 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:20:13,688 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:20:13,689 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:20:13,689 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:20:13,689 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:20:13,689 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:20:13,689 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:20:13,689 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:20:13,689 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:20:13,690 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:20:13,690 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:20:13,690 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:20:13,690 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:20:13,690 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:20:13,690 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:20:13,690 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:20:13,690 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:20:13,690 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:20:13,691 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:20:13,691 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:20:13,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:20:13,691 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:20:13,691 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:20:13,691 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:20:13,691 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:20:13,691 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:20:13,691 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:20:13,691 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:20:13,691 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:20:13,691 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:20:13,692 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:20:13,692 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b2243f2ebf184fce0ef7b08cdc971efef96ae919ab8c33e807ab93ab6dbfb0b7 [2025-03-03 14:20:13,918 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:20:13,927 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:20:13,928 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:20:13,929 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:20:13,929 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:20:13,930 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product40.cil.c [2025-03-03 14:20:15,075 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae02dca3f/76db084fa05d489d9a26fcb88eb69fcd/FLAGd3bedf456 [2025-03-03 14:20:15,368 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:20:15,369 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product40.cil.c [2025-03-03 14:20:15,388 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae02dca3f/76db084fa05d489d9a26fcb88eb69fcd/FLAGd3bedf456 [2025-03-03 14:20:15,401 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ae02dca3f/76db084fa05d489d9a26fcb88eb69fcd [2025-03-03 14:20:15,405 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:20:15,407 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:20:15,407 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:20:15,407 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:20:15,411 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:20:15,412 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:20:15" (1/1) ... [2025-03-03 14:20:15,413 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5537ee38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:15, skipping insertion in model container [2025-03-03 14:20:15,414 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:20:15" (1/1) ... [2025-03-03 14:20:15,456 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:20:15,654 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product40.cil.c[7657,7670] [2025-03-03 14:20:15,822 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:20:15,837 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:20:15,844 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-03-03 14:20:15,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [392] [2025-03-03 14:20:15,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [401] [2025-03-03 14:20:15,845 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [683] [2025-03-03 14:20:15,846 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [718] [2025-03-03 14:20:15,846 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [1780] [2025-03-03 14:20:15,846 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1800] [2025-03-03 14:20:15,846 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2022] [2025-03-03 14:20:15,846 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2039] [2025-03-03 14:20:15,847 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2103] [2025-03-03 14:20:15,847 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2510] [2025-03-03 14:20:15,862 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product40.cil.c[7657,7670] [2025-03-03 14:20:15,935 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:20:15,958 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:20:15,959 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:15 WrapperNode [2025-03-03 14:20:15,959 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:20:15,960 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:20:15,960 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:20:15,961 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:20:15,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:15" (1/1) ... [2025-03-03 14:20:15,985 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:15" (1/1) ... [2025-03-03 14:20:16,011 INFO L138 Inliner]: procedures = 127, calls = 185, calls flagged for inlining = 52, calls inlined = 49, statements flattened = 905 [2025-03-03 14:20:16,011 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:20:16,012 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:20:16,012 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:20:16,012 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:20:16,019 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:15" (1/1) ... [2025-03-03 14:20:16,019 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:15" (1/1) ... [2025-03-03 14:20:16,023 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:15" (1/1) ... [2025-03-03 14:20:16,040 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-03 14:20:16,042 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:15" (1/1) ... [2025-03-03 14:20:16,042 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:15" (1/1) ... [2025-03-03 14:20:16,051 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:15" (1/1) ... [2025-03-03 14:20:16,053 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:15" (1/1) ... [2025-03-03 14:20:16,055 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:15" (1/1) ... [2025-03-03 14:20:16,056 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:15" (1/1) ... [2025-03-03 14:20:16,067 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:20:16,071 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:20:16,071 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:20:16,071 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:20:16,072 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:15" (1/1) ... [2025-03-03 14:20:16,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:20:16,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:16,099 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-03 14:20:16,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-03 14:20:16,120 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-03 14:20:16,120 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-03 14:20:16,120 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-03 14:20:16,121 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-03 14:20:16,121 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:20:16,121 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:20:16,121 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-03-03 14:20:16,121 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-03-03 14:20:16,121 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:20:16,121 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:20:16,121 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:20:16,121 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:20:16,121 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:20:16,121 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:20:16,121 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:20:16,121 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:20:16,122 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:20:16,122 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:20:16,122 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-03 14:20:16,122 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-03 14:20:16,122 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:20:16,122 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:20:16,122 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:20:16,122 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-03 14:20:16,122 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-03 14:20:16,122 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:20:16,122 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:20:16,122 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:20:16,122 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:20:16,122 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:20:16,123 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:20:16,123 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:20:16,123 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:20:16,123 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:20:16,123 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:20:16,123 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:20:16,123 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:20:16,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:20:16,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:20:16,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:20:16,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:20:16,123 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:20:16,123 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:20:16,123 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-03 14:20:16,124 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-03 14:20:16,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:20:16,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:20:16,284 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:20:16,286 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:20:16,371 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1369-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~18#1; [2025-03-03 14:20:16,372 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1414: #res#1 := ~retValue_acc~19#1; [2025-03-03 14:20:16,383 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2100-1: createEmail_#res#1 := createEmail_~retValue_acc~28#1; [2025-03-03 14:20:16,400 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L866: #res := ~retValue_acc~11; [2025-03-03 14:20:16,453 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2228: #res := ~retValue_acc~32; [2025-03-03 14:20:16,508 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1192: #res := ~retValue_acc~15; [2025-03-03 14:20:16,603 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1757-1: getClientId_#res#1 := getClientId_~retValue_acc~24#1; [2025-03-03 14:20:16,603 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2154-1: getEmailId_#res#1 := getEmailId_~retValue_acc~30#1; [2025-03-03 14:20:16,603 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1275-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~16#1; [2025-03-03 14:20:16,603 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1710-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~23#1; [2025-03-03 14:20:16,872 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L599-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~3#1; [2025-03-03 14:20:16,872 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L715-1: valid_product_#res#1 := valid_product_~retValue_acc~7#1; [2025-03-03 14:20:16,872 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1477-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~20#1; [2025-03-03 14:20:16,872 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L590-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~2#1; [2025-03-03 14:20:16,872 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L608-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~4#1; [2025-03-03 14:20:16,872 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1584-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~21#1; [2025-03-03 14:20:16,878 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2191: #res := ~retValue_acc~31; [2025-03-03 14:20:16,880 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2076: #res := ~retValue_acc~26; [2025-03-03 14:20:16,967 INFO L? ?]: Removed 433 outVars from TransFormulas that were not future-live. [2025-03-03 14:20:16,967 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:20:16,977 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:20:16,977 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:20:16,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:20:16 BoogieIcfgContainer [2025-03-03 14:20:16,977 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:20:16,979 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:20:16,979 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:20:16,982 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:20:16,982 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:20:15" (1/3) ... [2025-03-03 14:20:16,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c0fe21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:20:16, skipping insertion in model container [2025-03-03 14:20:16,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:20:15" (2/3) ... [2025-03-03 14:20:16,983 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17c0fe21 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:20:16, skipping insertion in model container [2025-03-03 14:20:16,983 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:20:16" (3/3) ... [2025-03-03 14:20:16,984 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_product40.cil.c [2025-03-03 14:20:16,994 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:20:16,998 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_product40.cil.c that has 21 procedures, 335 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:20:17,056 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:20:17,066 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;@5f3425f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:20:17,066 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:20:17,071 INFO L276 IsEmpty]: Start isEmpty. Operand has 335 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 264 states have internal predecessors, (408), 52 states have call successors, (52), 20 states have call predecessors, (52), 20 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2025-03-03 14:20:17,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 14:20:17,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:17,084 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] [2025-03-03 14:20:17,085 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:17,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:17,089 INFO L85 PathProgramCache]: Analyzing trace with hash -2005497916, now seen corresponding path program 1 times [2025-03-03 14:20:17,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:17,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318798713] [2025-03-03 14:20:17,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:17,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:17,176 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 14:20:17,232 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 14:20:17,232 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:17,232 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:17,687 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 14:20:17,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:17,687 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318798713] [2025-03-03 14:20:17,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318798713] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:17,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [190756841] [2025-03-03 14:20:17,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:17,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:17,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:17,691 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:20:17,693 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-03 14:20:17,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 14:20:17,957 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 14:20:17,957 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:17,957 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:17,962 INFO L256 TraceCheckSpWp]: Trace formula consists of 976 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:20:17,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:20:17,991 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:17,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [190756841] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:17,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:17,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:20:17,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722057652] [2025-03-03 14:20:17,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:17,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:20:17,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:18,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:20:18,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:20:18,016 INFO L87 Difference]: Start difference. First operand has 335 states, 261 states have (on average 1.5632183908045978) internal successors, (408), 264 states have internal predecessors, (408), 52 states have call successors, (52), 20 states have call predecessors, (52), 20 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:18,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:18,054 INFO L93 Difference]: Finished difference Result 473 states and 708 transitions. [2025-03-03 14:20:18,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:20:18,056 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 106 [2025-03-03 14:20:18,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:18,065 INFO L225 Difference]: With dead ends: 473 [2025-03-03 14:20:18,065 INFO L226 Difference]: Without dead ends: 328 [2025-03-03 14:20:18,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:20:18,072 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:18,072 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 509 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:18,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-03 14:20:18,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-03-03 14:20:18,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 255 states have (on average 1.5607843137254902) internal successors, (398), 257 states have internal predecessors, (398), 52 states have call successors, (52), 20 states have call predecessors, (52), 20 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-03 14:20:18,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 501 transitions. [2025-03-03 14:20:18,129 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 501 transitions. Word has length 106 [2025-03-03 14:20:18,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:18,130 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 501 transitions. [2025-03-03 14:20:18,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:18,132 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 501 transitions. [2025-03-03 14:20:18,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 14:20:18,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:18,138 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] [2025-03-03 14:20:18,146 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:20:18,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-03 14:20:18,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:18,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:18,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1808582697, now seen corresponding path program 1 times [2025-03-03 14:20:18,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:18,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618583642] [2025-03-03 14:20:18,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:18,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:18,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 14:20:18,381 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 14:20:18,382 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:18,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:18,551 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 14:20:18,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:18,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618583642] [2025-03-03 14:20:18,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618583642] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:18,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1106713870] [2025-03-03 14:20:18,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:18,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:18,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:18,557 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:20:18,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-03 14:20:18,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 14:20:18,789 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 14:20:18,789 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:18,789 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:18,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 977 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:20:18,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:18,838 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:20:18,841 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:18,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1106713870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:18,842 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:18,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:20:18,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025138676] [2025-03-03 14:20:18,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:18,843 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:18,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:18,843 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:18,843 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:20:18,844 INFO L87 Difference]: Start difference. First operand 328 states and 501 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:18,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:18,879 INFO L93 Difference]: Finished difference Result 462 states and 686 transitions. [2025-03-03 14:20:18,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:18,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 107 [2025-03-03 14:20:18,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:18,882 INFO L225 Difference]: With dead ends: 462 [2025-03-03 14:20:18,882 INFO L226 Difference]: Without dead ends: 330 [2025-03-03 14:20:18,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:20:18,884 INFO L435 NwaCegarLoop]: 500 mSDtfsCounter, 0 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 998 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:18,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 998 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:18,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2025-03-03 14:20:18,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 330. [2025-03-03 14:20:18,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 330 states, 257 states have (on average 1.556420233463035) internal successors, (400), 259 states have internal predecessors, (400), 52 states have call successors, (52), 20 states have call predecessors, (52), 20 states have return successors, (51), 50 states have call predecessors, (51), 51 states have call successors, (51) [2025-03-03 14:20:18,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 503 transitions. [2025-03-03 14:20:18,910 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 503 transitions. Word has length 107 [2025-03-03 14:20:18,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:18,911 INFO L471 AbstractCegarLoop]: Abstraction has 330 states and 503 transitions. [2025-03-03 14:20:18,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:18,912 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 503 transitions. [2025-03-03 14:20:18,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:20:18,915 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:18,915 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:20:18,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:20:19,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-03 14:20:19,116 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:19,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:19,117 INFO L85 PathProgramCache]: Analyzing trace with hash 311913307, now seen corresponding path program 1 times [2025-03-03 14:20:19,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:19,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1535353459] [2025-03-03 14:20:19,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:19,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:19,136 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:20:19,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:20:19,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:19,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:19,306 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:20:19,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:19,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1535353459] [2025-03-03 14:20:19,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1535353459] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:19,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897060977] [2025-03-03 14:20:19,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:19,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:19,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:19,311 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:20:19,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-03 14:20:19,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:20:19,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:20:19,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:19,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:19,553 INFO L256 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:20:19,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:19,571 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:20:19,571 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:19,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897060977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:19,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:19,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:20:19,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433652660] [2025-03-03 14:20:19,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:19,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:19,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:19,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:19,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:20:19,573 INFO L87 Difference]: Start difference. First operand 330 states and 503 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:19,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:19,601 INFO L93 Difference]: Finished difference Result 712 states and 1105 transitions. [2025-03-03 14:20:19,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:19,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 115 [2025-03-03 14:20:19,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:19,604 INFO L225 Difference]: With dead ends: 712 [2025-03-03 14:20:19,604 INFO L226 Difference]: Without dead ends: 409 [2025-03-03 14:20:19,606 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:20:19,607 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 142 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 961 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:19,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 961 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:19,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 409 states. [2025-03-03 14:20:19,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 409 to 401. [2025-03-03 14:20:19,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 401 states, 314 states have (on average 1.5796178343949046) internal successors, (496), 316 states have internal predecessors, (496), 66 states have call successors, (66), 20 states have call predecessors, (66), 20 states have return successors, (65), 64 states have call predecessors, (65), 65 states have call successors, (65) [2025-03-03 14:20:19,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 401 states to 401 states and 627 transitions. [2025-03-03 14:20:19,626 INFO L78 Accepts]: Start accepts. Automaton has 401 states and 627 transitions. Word has length 115 [2025-03-03 14:20:19,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:19,626 INFO L471 AbstractCegarLoop]: Abstraction has 401 states and 627 transitions. [2025-03-03 14:20:19,626 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:19,627 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 627 transitions. [2025-03-03 14:20:19,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:20:19,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:19,628 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:20:19,636 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:20:19,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:19,830 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:19,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:19,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1398318498, now seen corresponding path program 1 times [2025-03-03 14:20:19,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:19,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824080209] [2025-03-03 14:20:19,830 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:19,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:19,847 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:20:19,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:20:19,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:19,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:19,965 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:20:19,965 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:19,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824080209] [2025-03-03 14:20:19,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824080209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:19,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526102278] [2025-03-03 14:20:19,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:19,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:19,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:19,968 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:20:19,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-03 14:20:20,118 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:20:20,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:20:20,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:20,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:20,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 1007 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:20:20,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:20,267 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:20:20,268 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:20,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526102278] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:20,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:20,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:20:20,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735110162] [2025-03-03 14:20:20,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:20,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:20:20,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:20,270 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:20:20,270 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:20:20,271 INFO L87 Difference]: Start difference. First operand 401 states and 627 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:20:20,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:20,334 INFO L93 Difference]: Finished difference Result 793 states and 1244 transitions. [2025-03-03 14:20:20,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:20:20,335 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 116 [2025-03-03 14:20:20,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:20,338 INFO L225 Difference]: With dead ends: 793 [2025-03-03 14:20:20,338 INFO L226 Difference]: Without dead ends: 403 [2025-03-03 14:20:20,339 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:20:20,340 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 2 mSDsluCounter, 1468 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1961 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:20,340 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1961 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:20,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2025-03-03 14:20:20,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 403. [2025-03-03 14:20:20,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 403 states, 315 states have (on average 1.5777777777777777) internal successors, (497), 318 states have internal predecessors, (497), 66 states have call successors, (66), 20 states have call predecessors, (66), 21 states have return successors, (67), 64 states have call predecessors, (67), 65 states have call successors, (67) [2025-03-03 14:20:20,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 630 transitions. [2025-03-03 14:20:20,361 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 630 transitions. Word has length 116 [2025-03-03 14:20:20,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:20,361 INFO L471 AbstractCegarLoop]: Abstraction has 403 states and 630 transitions. [2025-03-03 14:20:20,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:20:20,361 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 630 transitions. [2025-03-03 14:20:20,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:20:20,364 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:20,364 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:20:20,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:20:20,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:20,565 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:20,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:20,566 INFO L85 PathProgramCache]: Analyzing trace with hash 55441123, now seen corresponding path program 1 times [2025-03-03 14:20:20,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:20,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652503047] [2025-03-03 14:20:20,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:20,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:20,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:20:20,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:20:20,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:20,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:20,710 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:20:20,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:20,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652503047] [2025-03-03 14:20:20,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652503047] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:20,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2096805184] [2025-03-03 14:20:20,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:20,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:20,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:20,713 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:20:20,715 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-03 14:20:20,843 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:20:20,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:20:20,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:20,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:20,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 1008 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:20:20,964 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:21,011 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:20:21,011 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:20:21,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2096805184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:21,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:20:21,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:20:21,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821401892] [2025-03-03 14:20:21,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:21,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:20:21,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:21,012 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:20:21,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:20:21,013 INFO L87 Difference]: Start difference. First operand 403 states and 630 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:20:21,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:21,079 INFO L93 Difference]: Finished difference Result 795 states and 1249 transitions. [2025-03-03 14:20:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:20:21,081 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 117 [2025-03-03 14:20:21,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:21,084 INFO L225 Difference]: With dead ends: 795 [2025-03-03 14:20:21,084 INFO L226 Difference]: Without dead ends: 405 [2025-03-03 14:20:21,086 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:20:21,087 INFO L435 NwaCegarLoop]: 491 mSDtfsCounter, 2 mSDsluCounter, 1456 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1947 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:21,087 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1947 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:21,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-03 14:20:21,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2025-03-03 14:20:21,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 316 states have (on average 1.5759493670886076) internal successors, (498), 320 states have internal predecessors, (498), 66 states have call successors, (66), 20 states have call predecessors, (66), 22 states have return successors, (72), 64 states have call predecessors, (72), 65 states have call successors, (72) [2025-03-03 14:20:21,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 636 transitions. [2025-03-03 14:20:21,112 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 636 transitions. Word has length 117 [2025-03-03 14:20:21,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:21,113 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 636 transitions. [2025-03-03 14:20:21,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:20:21,113 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 636 transitions. [2025-03-03 14:20:21,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:20:21,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:21,117 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] [2025-03-03 14:20:21,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:20:21,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:21,318 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:21,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:21,319 INFO L85 PathProgramCache]: Analyzing trace with hash -596253375, now seen corresponding path program 1 times [2025-03-03 14:20:21,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:21,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683162212] [2025-03-03 14:20:21,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:21,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:21,338 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:20:21,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:20:21,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:21,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:21,444 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:20:21,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:21,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683162212] [2025-03-03 14:20:21,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683162212] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:21,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:21,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:20:21,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198975125] [2025-03-03 14:20:21,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:21,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:20:21,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:21,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:20:21,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:20:21,446 INFO L87 Difference]: Start difference. First operand 405 states and 636 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:20:21,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:21,488 INFO L93 Difference]: Finished difference Result 787 states and 1240 transitions. [2025-03-03 14:20:21,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:20:21,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 118 [2025-03-03 14:20:21,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:21,491 INFO L225 Difference]: With dead ends: 787 [2025-03-03 14:20:21,492 INFO L226 Difference]: Without dead ends: 405 [2025-03-03 14:20:21,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:20:21,494 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 2 mSDsluCounter, 1471 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:21,495 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1965 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:21,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2025-03-03 14:20:21,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 405. [2025-03-03 14:20:21,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 405 states, 316 states have (on average 1.5759493670886076) internal successors, (498), 320 states have internal predecessors, (498), 66 states have call successors, (66), 20 states have call predecessors, (66), 22 states have return successors, (71), 64 states have call predecessors, (71), 65 states have call successors, (71) [2025-03-03 14:20:21,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 635 transitions. [2025-03-03 14:20:21,519 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 635 transitions. Word has length 118 [2025-03-03 14:20:21,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:21,519 INFO L471 AbstractCegarLoop]: Abstraction has 405 states and 635 transitions. [2025-03-03 14:20:21,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:20:21,519 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 635 transitions. [2025-03-03 14:20:21,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:20:21,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:21,522 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:21,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:20:21,522 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:21,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:21,523 INFO L85 PathProgramCache]: Analyzing trace with hash -139027360, now seen corresponding path program 2 times [2025-03-03 14:20:21,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:21,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765992211] [2025-03-03 14:20:21,523 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:20:21,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:21,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 119 statements into 2 equivalence classes. [2025-03-03 14:20:21,562 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 59 of 119 statements. [2025-03-03 14:20:21,562 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:20:21,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:21,621 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 14:20:21,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:21,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765992211] [2025-03-03 14:20:21,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765992211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:21,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:21,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:20:21,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893785727] [2025-03-03 14:20:21,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:21,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:20:21,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:21,623 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:20:21,623 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:20:21,623 INFO L87 Difference]: Start difference. First operand 405 states and 635 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:21,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:21,677 INFO L93 Difference]: Finished difference Result 909 states and 1417 transitions. [2025-03-03 14:20:21,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:20:21,678 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 119 [2025-03-03 14:20:21,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:21,684 INFO L225 Difference]: With dead ends: 909 [2025-03-03 14:20:21,684 INFO L226 Difference]: Without dead ends: 785 [2025-03-03 14:20:21,684 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-03 14:20:21,685 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 447 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 1965 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:21,686 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 1965 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:21,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2025-03-03 14:20:21,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 781. [2025-03-03 14:20:21,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 781 states, 613 states have (on average 1.5889070146818924) internal successors, (974), 619 states have internal predecessors, (974), 126 states have call successors, (126), 39 states have call predecessors, (126), 41 states have return successors, (130), 122 states have call predecessors, (130), 124 states have call successors, (130) [2025-03-03 14:20:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 781 states to 781 states and 1230 transitions. [2025-03-03 14:20:21,724 INFO L78 Accepts]: Start accepts. Automaton has 781 states and 1230 transitions. Word has length 119 [2025-03-03 14:20:21,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:21,725 INFO L471 AbstractCegarLoop]: Abstraction has 781 states and 1230 transitions. [2025-03-03 14:20:21,725 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:21,725 INFO L276 IsEmpty]: Start isEmpty. Operand 781 states and 1230 transitions. [2025-03-03 14:20:21,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:20:21,729 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:21,729 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:21,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:20:21,730 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:21,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:21,730 INFO L85 PathProgramCache]: Analyzing trace with hash -1369881255, now seen corresponding path program 1 times [2025-03-03 14:20:21,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:21,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954352038] [2025-03-03 14:20:21,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:21,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:21,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:20:21,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:20:21,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:21,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:21,856 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:20:21,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:21,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954352038] [2025-03-03 14:20:21,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954352038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:21,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:21,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:20:21,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886886682] [2025-03-03 14:20:21,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:21,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:20:21,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:21,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:20:21,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:20:21,858 INFO L87 Difference]: Start difference. First operand 781 states and 1230 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:20:21,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:21,902 INFO L93 Difference]: Finished difference Result 1541 states and 2433 transitions. [2025-03-03 14:20:21,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:20:21,902 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 120 [2025-03-03 14:20:21,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:21,906 INFO L225 Difference]: With dead ends: 1541 [2025-03-03 14:20:21,906 INFO L226 Difference]: Without dead ends: 783 [2025-03-03 14:20:21,908 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:20:21,909 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 1 mSDsluCounter, 1473 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1968 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:21,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1968 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:21,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-03-03 14:20:21,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 783. [2025-03-03 14:20:21,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 783 states, 614 states have (on average 1.5879478827361564) internal successors, (975), 621 states have internal predecessors, (975), 126 states have call successors, (126), 39 states have call predecessors, (126), 42 states have return successors, (132), 122 states have call predecessors, (132), 124 states have call successors, (132) [2025-03-03 14:20:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 783 states to 783 states and 1233 transitions. [2025-03-03 14:20:21,940 INFO L78 Accepts]: Start accepts. Automaton has 783 states and 1233 transitions. Word has length 120 [2025-03-03 14:20:21,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:21,941 INFO L471 AbstractCegarLoop]: Abstraction has 783 states and 1233 transitions. [2025-03-03 14:20:21,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:20:21,941 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1233 transitions. [2025-03-03 14:20:21,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:20:21,944 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:21,944 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] [2025-03-03 14:20:21,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:20:21,944 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:21,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:21,945 INFO L85 PathProgramCache]: Analyzing trace with hash 686987515, now seen corresponding path program 1 times [2025-03-03 14:20:21,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:21,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947926184] [2025-03-03 14:20:21,945 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:21,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:21,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:20:21,968 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:20:21,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:21,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:22,072 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:20:22,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:22,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947926184] [2025-03-03 14:20:22,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947926184] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:22,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:22,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:20:22,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416121832] [2025-03-03 14:20:22,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:22,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:20:22,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:22,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:20:22,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:20:22,074 INFO L87 Difference]: Start difference. First operand 783 states and 1233 transitions. Second operand has 8 states, 7 states have (on average 11.571428571428571) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:20:22,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:22,206 INFO L93 Difference]: Finished difference Result 1545 states and 2436 transitions. [2025-03-03 14:20:22,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:20:22,207 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.571428571428571) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 121 [2025-03-03 14:20:22,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:22,211 INFO L225 Difference]: With dead ends: 1545 [2025-03-03 14:20:22,211 INFO L226 Difference]: Without dead ends: 787 [2025-03-03 14:20:22,213 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-03-03 14:20:22,213 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 7 mSDsluCounter, 2881 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3366 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-03-03 14:20:22,213 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3366 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:20:22,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 787 states. [2025-03-03 14:20:22,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 787 to 785. [2025-03-03 14:20:22,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 785 states, 616 states have (on average 1.5860389610389611) internal successors, (977), 622 states have internal predecessors, (977), 126 states have call successors, (126), 40 states have call predecessors, (126), 42 states have return successors, (131), 122 states have call predecessors, (131), 124 states have call successors, (131) [2025-03-03 14:20:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 785 states to 785 states and 1234 transitions. [2025-03-03 14:20:22,244 INFO L78 Accepts]: Start accepts. Automaton has 785 states and 1234 transitions. Word has length 121 [2025-03-03 14:20:22,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:22,245 INFO L471 AbstractCegarLoop]: Abstraction has 785 states and 1234 transitions. [2025-03-03 14:20:22,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.571428571428571) internal successors, (81), 8 states have internal predecessors, (81), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:20:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 785 states and 1234 transitions. [2025-03-03 14:20:22,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 14:20:22,248 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:22,248 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:22,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:20:22,249 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:22,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:22,249 INFO L85 PathProgramCache]: Analyzing trace with hash 148730491, now seen corresponding path program 2 times [2025-03-03 14:20:22,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:22,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744877106] [2025-03-03 14:20:22,249 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:20:22,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:22,267 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 122 statements into 2 equivalence classes. [2025-03-03 14:20:22,271 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 62 of 122 statements. [2025-03-03 14:20:22,271 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:20:22,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:20:22,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:22,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1744877106] [2025-03-03 14:20:22,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1744877106] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:22,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:22,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:20:22,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842816818] [2025-03-03 14:20:22,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:22,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:20:22,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:22,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:20:22,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:20:22,336 INFO L87 Difference]: Start difference. First operand 785 states and 1234 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:22,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:22,427 INFO L93 Difference]: Finished difference Result 1065 states and 1629 transitions. [2025-03-03 14:20:22,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:20:22,428 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 122 [2025-03-03 14:20:22,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:22,433 INFO L225 Difference]: With dead ends: 1065 [2025-03-03 14:20:22,433 INFO L226 Difference]: Without dead ends: 815 [2025-03-03 14:20:22,435 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-03-03 14:20:22,435 INFO L435 NwaCegarLoop]: 494 mSDtfsCounter, 22 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2442 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:22,435 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2442 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:22,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 815 states. [2025-03-03 14:20:22,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 815 to 803. [2025-03-03 14:20:22,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 628 states have (on average 1.5780254777070064) internal successors, (991), 634 states have internal predecessors, (991), 132 states have call successors, (132), 40 states have call predecessors, (132), 42 states have return successors, (137), 128 states have call predecessors, (137), 130 states have call successors, (137) [2025-03-03 14:20:22,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1260 transitions. [2025-03-03 14:20:22,467 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1260 transitions. Word has length 122 [2025-03-03 14:20:22,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:22,467 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1260 transitions. [2025-03-03 14:20:22,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 6 states have internal predecessors, (75), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:22,468 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1260 transitions. [2025-03-03 14:20:22,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:20:22,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:22,474 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:20:22,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:20:22,475 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:22,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:22,475 INFO L85 PathProgramCache]: Analyzing trace with hash -2018626335, now seen corresponding path program 1 times [2025-03-03 14:20:22,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:22,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890047434] [2025-03-03 14:20:22,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:22,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:22,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:20:22,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:20:22,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:22,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:22,591 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:20:22,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:22,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890047434] [2025-03-03 14:20:22,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890047434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:22,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:22,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:20:22,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448475600] [2025-03-03 14:20:22,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:22,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:20:22,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:22,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:20:22,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:20:22,593 INFO L87 Difference]: Start difference. First operand 803 states and 1260 transitions. Second operand has 8 states, 7 states have (on average 11.857142857142858) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:20:22,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:22,740 INFO L93 Difference]: Finished difference Result 1584 states and 2495 transitions. [2025-03-03 14:20:22,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:20:22,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.857142857142858) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 123 [2025-03-03 14:20:22,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:22,747 INFO L225 Difference]: With dead ends: 1584 [2025-03-03 14:20:22,747 INFO L226 Difference]: Without dead ends: 808 [2025-03-03 14:20:22,750 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-03-03 14:20:22,750 INFO L435 NwaCegarLoop]: 487 mSDtfsCounter, 5 mSDsluCounter, 2893 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3380 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-03-03 14:20:22,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3380 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:20:22,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-03-03 14:20:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 806. [2025-03-03 14:20:22,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 806 states, 630 states have (on average 1.5761904761904761) internal successors, (993), 637 states have internal predecessors, (993), 132 states have call successors, (132), 40 states have call predecessors, (132), 43 states have return successors, (142), 128 states have call predecessors, (142), 130 states have call successors, (142) [2025-03-03 14:20:22,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 1267 transitions. [2025-03-03 14:20:22,781 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 1267 transitions. Word has length 123 [2025-03-03 14:20:22,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:22,781 INFO L471 AbstractCegarLoop]: Abstraction has 806 states and 1267 transitions. [2025-03-03 14:20:22,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.857142857142858) internal successors, (83), 8 states have internal predecessors, (83), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-03-03 14:20:22,782 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1267 transitions. [2025-03-03 14:20:22,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 14:20:22,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:22,785 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] [2025-03-03 14:20:22,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:20:22,785 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:22,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:22,785 INFO L85 PathProgramCache]: Analyzing trace with hash 894003262, now seen corresponding path program 1 times [2025-03-03 14:20:22,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:22,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813759460] [2025-03-03 14:20:22,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:22,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:22,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:20:22,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:20:22,808 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:22,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:22,921 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:20:22,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:22,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813759460] [2025-03-03 14:20:22,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813759460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:20:22,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030006724] [2025-03-03 14:20:22,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:22,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:22,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:20:22,924 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:20:22,927 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:20:23,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:20:23,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:20:23,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:23,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:23,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:20:23,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:20:23,200 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:23,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:20:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:23,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030006724] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:20:23,324 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:20:23,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-03 14:20:23,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861815273] [2025-03-03 14:20:23,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:20:23,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:20:23,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:23,326 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:20:23,326 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:20:23,326 INFO L87 Difference]: Start difference. First operand 806 states and 1267 transitions. Second operand has 11 states, 10 states have (on average 12.6) internal successors, (126), 11 states have internal predecessors, (126), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:20:23,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:23,896 INFO L93 Difference]: Finished difference Result 2335 states and 3800 transitions. [2025-03-03 14:20:23,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:20:23,897 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 12.6) internal successors, (126), 11 states have internal predecessors, (126), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 124 [2025-03-03 14:20:23,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:23,906 INFO L225 Difference]: With dead ends: 2335 [2025-03-03 14:20:23,907 INFO L226 Difference]: Without dead ends: 1561 [2025-03-03 14:20:23,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-03-03 14:20:23,911 INFO L435 NwaCegarLoop]: 492 mSDtfsCounter, 1405 mSDsluCounter, 3096 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1405 SdHoareTripleChecker+Valid, 3588 SdHoareTripleChecker+Invalid, 667 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:23,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1405 Valid, 3588 Invalid, 667 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:20:23,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1561 states. [2025-03-03 14:20:23,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1561 to 1521. [2025-03-03 14:20:23,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1521 states, 1218 states have (on average 1.6182266009852218) internal successors, (1971), 1224 states have internal predecessors, (1971), 259 states have call successors, (259), 41 states have call predecessors, (259), 43 states have return successors, (279), 255 states have call predecessors, (279), 257 states have call successors, (279) [2025-03-03 14:20:23,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1521 states to 1521 states and 2509 transitions. [2025-03-03 14:20:23,976 INFO L78 Accepts]: Start accepts. Automaton has 1521 states and 2509 transitions. Word has length 124 [2025-03-03 14:20:23,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:23,977 INFO L471 AbstractCegarLoop]: Abstraction has 1521 states and 2509 transitions. [2025-03-03 14:20:23,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 12.6) internal successors, (126), 11 states have internal predecessors, (126), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-03-03 14:20:23,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1521 states and 2509 transitions. [2025-03-03 14:20:23,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 14:20:23,984 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:23,984 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] [2025-03-03 14:20:23,994 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 14:20:24,185 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:20:24,185 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:24,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:24,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1593131036, now seen corresponding path program 1 times [2025-03-03 14:20:24,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:24,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1558452039] [2025-03-03 14:20:24,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:24,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:24,201 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:20:24,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:20:24,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:24,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:24,235 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:24,236 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:24,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1558452039] [2025-03-03 14:20:24,236 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1558452039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:24,236 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:24,236 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:24,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113865207] [2025-03-03 14:20:24,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:24,236 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:24,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:24,237 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:24,237 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:24,237 INFO L87 Difference]: Start difference. First operand 1521 states and 2509 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:24,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:24,328 INFO L93 Difference]: Finished difference Result 3644 states and 6090 transitions. [2025-03-03 14:20:24,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:24,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2025-03-03 14:20:24,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:24,341 INFO L225 Difference]: With dead ends: 3644 [2025-03-03 14:20:24,341 INFO L226 Difference]: Without dead ends: 2204 [2025-03-03 14:20:24,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:24,347 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 139 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:24,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1003 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:24,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2204 states. [2025-03-03 14:20:24,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2204 to 2188. [2025-03-03 14:20:24,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2188 states, 1758 states have (on average 1.6342434584755403) internal successors, (2873), 1764 states have internal predecessors, (2873), 386 states have call successors, (386), 41 states have call predecessors, (386), 43 states have return successors, (416), 382 states have call predecessors, (416), 384 states have call successors, (416) [2025-03-03 14:20:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2188 states to 2188 states and 3675 transitions. [2025-03-03 14:20:24,436 INFO L78 Accepts]: Start accepts. Automaton has 2188 states and 3675 transitions. Word has length 127 [2025-03-03 14:20:24,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:24,436 INFO L471 AbstractCegarLoop]: Abstraction has 2188 states and 3675 transitions. [2025-03-03 14:20:24,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:24,436 INFO L276 IsEmpty]: Start isEmpty. Operand 2188 states and 3675 transitions. [2025-03-03 14:20:24,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 14:20:24,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:24,446 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] [2025-03-03 14:20:24,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:20:24,446 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:24,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:24,447 INFO L85 PathProgramCache]: Analyzing trace with hash -935152650, now seen corresponding path program 1 times [2025-03-03 14:20:24,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:24,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248714624] [2025-03-03 14:20:24,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:24,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:24,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 14:20:24,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 14:20:24,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:24,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:24,496 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:24,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:24,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248714624] [2025-03-03 14:20:24,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248714624] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:24,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:24,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:24,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609317902] [2025-03-03 14:20:24,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:24,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:24,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:24,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:24,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:24,498 INFO L87 Difference]: Start difference. First operand 2188 states and 3675 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:24,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:24,617 INFO L93 Difference]: Finished difference Result 5350 states and 9043 transitions. [2025-03-03 14:20:24,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:24,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2025-03-03 14:20:24,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:24,635 INFO L225 Difference]: With dead ends: 5350 [2025-03-03 14:20:24,635 INFO L226 Difference]: Without dead ends: 3294 [2025-03-03 14:20:24,642 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:24,642 INFO L435 NwaCegarLoop]: 503 mSDtfsCounter, 137 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:24,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 996 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:24,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2025-03-03 14:20:24,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3278. [2025-03-03 14:20:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3278 states, 2655 states have (on average 1.6421845574387948) internal successors, (4360), 2661 states have internal predecessors, (4360), 579 states have call successors, (579), 41 states have call predecessors, (579), 43 states have return successors, (609), 575 states have call predecessors, (609), 577 states have call successors, (609) [2025-03-03 14:20:24,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3278 states to 3278 states and 5548 transitions. [2025-03-03 14:20:24,807 INFO L78 Accepts]: Start accepts. Automaton has 3278 states and 5548 transitions. Word has length 128 [2025-03-03 14:20:24,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:24,808 INFO L471 AbstractCegarLoop]: Abstraction has 3278 states and 5548 transitions. [2025-03-03 14:20:24,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:24,808 INFO L276 IsEmpty]: Start isEmpty. Operand 3278 states and 5548 transitions. [2025-03-03 14:20:24,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 14:20:24,822 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:24,823 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] [2025-03-03 14:20:24,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:20:24,823 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:24,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:24,823 INFO L85 PathProgramCache]: Analyzing trace with hash 767623387, now seen corresponding path program 1 times [2025-03-03 14:20:24,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:24,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715474324] [2025-03-03 14:20:24,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:24,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:24,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:20:24,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:20:24,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:24,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:24,879 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:24,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:24,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715474324] [2025-03-03 14:20:24,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715474324] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:24,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:24,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:24,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384243612] [2025-03-03 14:20:24,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:24,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:24,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:24,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:24,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:24,880 INFO L87 Difference]: Start difference. First operand 3278 states and 5548 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:25,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:25,013 INFO L93 Difference]: Finished difference Result 8038 states and 13698 transitions. [2025-03-03 14:20:25,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:25,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2025-03-03 14:20:25,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:25,039 INFO L225 Difference]: With dead ends: 8038 [2025-03-03 14:20:25,040 INFO L226 Difference]: Without dead ends: 5024 [2025-03-03 14:20:25,050 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:25,050 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 135 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:25,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 989 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:25,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5024 states. [2025-03-03 14:20:25,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5024 to 5008. [2025-03-03 14:20:25,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5008 states, 4113 states have (on average 1.650133722343788) internal successors, (6787), 4119 states have internal predecessors, (6787), 851 states have call successors, (851), 41 states have call predecessors, (851), 43 states have return successors, (897), 847 states have call predecessors, (897), 849 states have call successors, (897) [2025-03-03 14:20:25,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5008 states to 5008 states and 8535 transitions. [2025-03-03 14:20:25,262 INFO L78 Accepts]: Start accepts. Automaton has 5008 states and 8535 transitions. Word has length 129 [2025-03-03 14:20:25,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:25,262 INFO L471 AbstractCegarLoop]: Abstraction has 5008 states and 8535 transitions. [2025-03-03 14:20:25,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:25,262 INFO L276 IsEmpty]: Start isEmpty. Operand 5008 states and 8535 transitions. [2025-03-03 14:20:25,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 14:20:25,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:25,308 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] [2025-03-03 14:20:25,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:20:25,309 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:25,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:25,309 INFO L85 PathProgramCache]: Analyzing trace with hash 475173079, now seen corresponding path program 1 times [2025-03-03 14:20:25,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:25,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574013763] [2025-03-03 14:20:25,309 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:25,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:25,323 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:20:25,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:20:25,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:25,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:25,352 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:25,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:25,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574013763] [2025-03-03 14:20:25,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574013763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:25,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:25,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:25,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278898639] [2025-03-03 14:20:25,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:25,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:25,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:25,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:25,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:25,354 INFO L87 Difference]: Start difference. First operand 5008 states and 8535 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:25,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:25,522 INFO L93 Difference]: Finished difference Result 12469 states and 21384 transitions. [2025-03-03 14:20:25,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:25,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 130 [2025-03-03 14:20:25,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:25,572 INFO L225 Difference]: With dead ends: 12469 [2025-03-03 14:20:25,573 INFO L226 Difference]: Without dead ends: 7940 [2025-03-03 14:20:25,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:25,589 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 133 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 989 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:25,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 989 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:25,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7940 states. [2025-03-03 14:20:25,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7940 to 7924. [2025-03-03 14:20:25,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7924 states, 6602 states have (on average 1.6572250833080884) internal successors, (10941), 6608 states have internal predecessors, (10941), 1278 states have call successors, (1278), 41 states have call predecessors, (1278), 43 states have return successors, (1350), 1274 states have call predecessors, (1350), 1276 states have call successors, (1350) [2025-03-03 14:20:25,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7924 states to 7924 states and 13569 transitions. [2025-03-03 14:20:25,906 INFO L78 Accepts]: Start accepts. Automaton has 7924 states and 13569 transitions. Word has length 130 [2025-03-03 14:20:25,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:25,907 INFO L471 AbstractCegarLoop]: Abstraction has 7924 states and 13569 transitions. [2025-03-03 14:20:25,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:25,907 INFO L276 IsEmpty]: Start isEmpty. Operand 7924 states and 13569 transitions. [2025-03-03 14:20:25,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 14:20:25,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:25,932 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] [2025-03-03 14:20:25,932 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:20:25,932 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:25,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:25,933 INFO L85 PathProgramCache]: Analyzing trace with hash 152107706, now seen corresponding path program 1 times [2025-03-03 14:20:25,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:25,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612449725] [2025-03-03 14:20:25,933 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:25,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:25,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:20:25,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:20:25,956 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:25,956 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:25,986 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:25,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:25,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612449725] [2025-03-03 14:20:25,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612449725] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:25,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:25,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:25,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871836490] [2025-03-03 14:20:25,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:25,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:25,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:25,988 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:25,988 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:25,988 INFO L87 Difference]: Start difference. First operand 7924 states and 13569 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:26,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:26,310 INFO L93 Difference]: Finished difference Result 19778 states and 34134 transitions. [2025-03-03 14:20:26,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:26,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 131 [2025-03-03 14:20:26,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:26,368 INFO L225 Difference]: With dead ends: 19778 [2025-03-03 14:20:26,369 INFO L226 Difference]: Without dead ends: 13240 [2025-03-03 14:20:26,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:26,447 INFO L435 NwaCegarLoop]: 516 mSDtfsCounter, 131 mSDsluCounter, 489 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1005 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:26,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1005 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:26,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13240 states. [2025-03-03 14:20:26,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13240 to 13224. [2025-03-03 14:20:26,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13224 states, 10966 states have (on average 1.6604960787889842) internal successors, (18209), 10972 states have internal predecessors, (18209), 2214 states have call successors, (2214), 41 states have call predecessors, (2214), 43 states have return successors, (2330), 2210 states have call predecessors, (2330), 2212 states have call successors, (2330) [2025-03-03 14:20:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13224 states to 13224 states and 22753 transitions. [2025-03-03 14:20:26,940 INFO L78 Accepts]: Start accepts. Automaton has 13224 states and 22753 transitions. Word has length 131 [2025-03-03 14:20:26,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:26,941 INFO L471 AbstractCegarLoop]: Abstraction has 13224 states and 22753 transitions. [2025-03-03 14:20:26,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:26,942 INFO L276 IsEmpty]: Start isEmpty. Operand 13224 states and 22753 transitions. [2025-03-03 14:20:26,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 14:20:26,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:26,973 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] [2025-03-03 14:20:26,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:20:26,974 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:26,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:26,975 INFO L85 PathProgramCache]: Analyzing trace with hash 920140728, now seen corresponding path program 1 times [2025-03-03 14:20:26,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:26,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899677665] [2025-03-03 14:20:26,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:26,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:26,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:20:26,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:20:26,999 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:26,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:27,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:27,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899677665] [2025-03-03 14:20:27,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1899677665] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:27,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:27,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:27,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397693265] [2025-03-03 14:20:27,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:27,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:27,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:27,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:27,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:27,028 INFO L87 Difference]: Start difference. First operand 13224 states and 22753 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:27,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:27,446 INFO L93 Difference]: Finished difference Result 34524 states and 59734 transitions. [2025-03-03 14:20:27,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:27,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2025-03-03 14:20:27,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:27,537 INFO L225 Difference]: With dead ends: 34524 [2025-03-03 14:20:27,537 INFO L226 Difference]: Without dead ends: 22914 [2025-03-03 14:20:27,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:27,583 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 129 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:27,583 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 992 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:27,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22914 states. [2025-03-03 14:20:28,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22914 to 22898. [2025-03-03 14:20:28,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22898 states, 19082 states have (on average 1.6603605492086784) internal successors, (31683), 19088 states have internal predecessors, (31683), 3772 states have call successors, (3772), 41 states have call predecessors, (3772), 43 states have return successors, (3966), 3768 states have call predecessors, (3966), 3770 states have call successors, (3966) [2025-03-03 14:20:28,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22898 states to 22898 states and 39421 transitions. [2025-03-03 14:20:28,655 INFO L78 Accepts]: Start accepts. Automaton has 22898 states and 39421 transitions. Word has length 132 [2025-03-03 14:20:28,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:28,655 INFO L471 AbstractCegarLoop]: Abstraction has 22898 states and 39421 transitions. [2025-03-03 14:20:28,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:28,655 INFO L276 IsEmpty]: Start isEmpty. Operand 22898 states and 39421 transitions. [2025-03-03 14:20:28,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:20:28,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:28,691 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] [2025-03-03 14:20:28,692 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:20:28,692 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:28,692 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:28,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1375907513, now seen corresponding path program 1 times [2025-03-03 14:20:28,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:28,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846720694] [2025-03-03 14:20:28,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:28,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:28,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:20:28,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:20:28,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:28,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:28,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:28,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846720694] [2025-03-03 14:20:28,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846720694] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:28,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:28,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:28,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1836623219] [2025-03-03 14:20:28,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:28,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:28,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:28,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:28,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:28,738 INFO L87 Difference]: Start difference. First operand 22898 states and 39421 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:29,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:29,336 INFO L93 Difference]: Finished difference Result 56605 states and 97232 transitions. [2025-03-03 14:20:29,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:29,337 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 133 [2025-03-03 14:20:29,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:29,454 INFO L225 Difference]: With dead ends: 56605 [2025-03-03 14:20:29,454 INFO L226 Difference]: Without dead ends: 36748 [2025-03-03 14:20:29,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:29,503 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 127 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 964 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:29,503 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 964 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:29,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36748 states. [2025-03-03 14:20:30,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36748 to 36732. [2025-03-03 14:20:30,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36732 states, 30597 states have (on average 1.6358793345752851) internal successors, (50053), 30603 states have internal predecessors, (50053), 6091 states have call successors, (6091), 41 states have call predecessors, (6091), 43 states have return successors, (6429), 6087 states have call predecessors, (6429), 6089 states have call successors, (6429) [2025-03-03 14:20:30,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36732 states to 36732 states and 62573 transitions. [2025-03-03 14:20:30,773 INFO L78 Accepts]: Start accepts. Automaton has 36732 states and 62573 transitions. Word has length 133 [2025-03-03 14:20:30,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:30,773 INFO L471 AbstractCegarLoop]: Abstraction has 36732 states and 62573 transitions. [2025-03-03 14:20:30,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:30,774 INFO L276 IsEmpty]: Start isEmpty. Operand 36732 states and 62573 transitions. [2025-03-03 14:20:30,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-03 14:20:30,814 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:30,814 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] [2025-03-03 14:20:30,814 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:20:30,814 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:30,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:30,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1012286951, now seen corresponding path program 1 times [2025-03-03 14:20:30,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:30,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405095896] [2025-03-03 14:20:30,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:30,815 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:30,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-03 14:20:30,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-03 14:20:30,840 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:30,840 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:30,872 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:30,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:30,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405095896] [2025-03-03 14:20:30,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405095896] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:30,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:30,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:30,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562515088] [2025-03-03 14:20:30,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:30,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:30,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:30,874 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:30,874 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:30,874 INFO L87 Difference]: Start difference. First operand 36732 states and 62573 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:32,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:32,327 INFO L93 Difference]: Finished difference Result 99906 states and 170754 transitions. [2025-03-03 14:20:32,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:32,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 134 [2025-03-03 14:20:32,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:32,611 INFO L225 Difference]: With dead ends: 99906 [2025-03-03 14:20:32,612 INFO L226 Difference]: Without dead ends: 67112 [2025-03-03 14:20:32,709 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:32,710 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 125 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:32,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 992 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:32,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67112 states. [2025-03-03 14:20:34,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67112 to 67096. [2025-03-03 14:20:34,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67096 states, 56175 states have (on average 1.6327547841566532) internal successors, (91720), 56181 states have internal predecessors, (91720), 10877 states have call successors, (10877), 41 states have call predecessors, (10877), 43 states have return successors, (11489), 10873 states have call predecessors, (11489), 10875 states have call successors, (11489) [2025-03-03 14:20:34,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67096 states to 67096 states and 114086 transitions. [2025-03-03 14:20:34,685 INFO L78 Accepts]: Start accepts. Automaton has 67096 states and 114086 transitions. Word has length 134 [2025-03-03 14:20:34,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:34,685 INFO L471 AbstractCegarLoop]: Abstraction has 67096 states and 114086 transitions. [2025-03-03 14:20:34,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:34,685 INFO L276 IsEmpty]: Start isEmpty. Operand 67096 states and 114086 transitions. [2025-03-03 14:20:34,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-03 14:20:34,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:34,725 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] [2025-03-03 14:20:34,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:20:34,725 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:34,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:34,726 INFO L85 PathProgramCache]: Analyzing trace with hash -101662248, now seen corresponding path program 1 times [2025-03-03 14:20:34,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:34,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152577561] [2025-03-03 14:20:34,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:34,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:34,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-03 14:20:34,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-03 14:20:34,748 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:34,748 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:34,773 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:34,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:34,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152577561] [2025-03-03 14:20:34,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152577561] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:34,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:34,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:34,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576587874] [2025-03-03 14:20:34,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:34,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:34,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:34,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:34,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:34,774 INFO L87 Difference]: Start difference. First operand 67096 states and 114086 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:37,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:37,655 INFO L93 Difference]: Finished difference Result 187169 states and 319082 transitions. [2025-03-03 14:20:37,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:37,656 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 135 [2025-03-03 14:20:37,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:38,159 INFO L225 Difference]: With dead ends: 187169 [2025-03-03 14:20:38,160 INFO L226 Difference]: Without dead ends: 125240 [2025-03-03 14:20:38,302 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:38,303 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 123 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 995 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:38,303 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 995 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:38,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125240 states. [2025-03-03 14:20:41,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125240 to 125224. [2025-03-03 14:20:42,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125224 states, 105406 states have (on average 1.6285126083904142) internal successors, (171655), 105412 states have internal predecessors, (171655), 19774 states have call successors, (19774), 41 states have call predecessors, (19774), 43 states have return successors, (20918), 19770 states have call predecessors, (20918), 19772 states have call successors, (20918) [2025-03-03 14:20:42,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125224 states to 125224 states and 212347 transitions. [2025-03-03 14:20:42,525 INFO L78 Accepts]: Start accepts. Automaton has 125224 states and 212347 transitions. Word has length 135 [2025-03-03 14:20:42,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:20:42,526 INFO L471 AbstractCegarLoop]: Abstraction has 125224 states and 212347 transitions. [2025-03-03 14:20:42,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:42,526 INFO L276 IsEmpty]: Start isEmpty. Operand 125224 states and 212347 transitions. [2025-03-03 14:20:42,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 14:20:42,582 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:20:42,582 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] [2025-03-03 14:20:42,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:20:42,582 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:20:42,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:20:42,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1475804902, now seen corresponding path program 1 times [2025-03-03 14:20:42,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:20:42,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708904323] [2025-03-03 14:20:42,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:20:42,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:20:42,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:20:42,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:20:42,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:20:42,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:20:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:20:42,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:20:42,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708904323] [2025-03-03 14:20:42,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708904323] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:20:42,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:20:42,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:20:42,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369920405] [2025-03-03 14:20:42,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:20:42,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:20:42,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:20:42,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:20:42,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:42,633 INFO L87 Difference]: Start difference. First operand 125224 states and 212347 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:20:47,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:20:47,007 INFO L93 Difference]: Finished difference Result 236427 states and 401613 transitions. [2025-03-03 14:20:47,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:20:47,008 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, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 136 [2025-03-03 14:20:47,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:20:47,935 INFO L225 Difference]: With dead ends: 236427 [2025-03-03 14:20:47,935 INFO L226 Difference]: Without dead ends: 236143 [2025-03-03 14:20:48,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:20:48,028 INFO L435 NwaCegarLoop]: 508 mSDtfsCounter, 118 mSDsluCounter, 498 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:20:48,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1006 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:20:48,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236143 states.