./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec4_product27.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_spec4_product27.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 4373ae32f100aa418b32a7018bfdec5c3f7ae719a7f9b296410b14fba54a4baf --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:24:17,619 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:24:17,672 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:24:17,678 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:24:17,681 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:24:17,700 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:24:17,701 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:24:17,701 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:24:17,701 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:24:17,701 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:24:17,701 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:24:17,702 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:24:17,702 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:24:17,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:24:17,702 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:24:17,702 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:24:17,702 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:24:17,702 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:24:17,702 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:24:17,702 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:24:17,703 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:24:17,703 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:24:17,703 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:24:17,703 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:24:17,703 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:24:17,703 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:24:17,703 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:24:17,703 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:24:17,703 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:24:17,703 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:24:17,703 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:24:17,703 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:24:17,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:24:17,704 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:24:17,704 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:24:17,704 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:24:17,704 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:24:17,704 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:24:17,704 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:24:17,704 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:24:17,704 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:24:17,704 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:24:17,704 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:24:17,704 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 -> 4373ae32f100aa418b32a7018bfdec5c3f7ae719a7f9b296410b14fba54a4baf [2025-03-03 14:24:17,934 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:24:17,939 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:24:17,941 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:24:17,942 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:24:17,942 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:24:17,943 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec4_product27.cil.c [2025-03-03 14:24:19,071 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e7d7f27d/3cb0c3cc9c9c48b08296551ab682efca/FLAGbf1eae12c [2025-03-03 14:24:19,382 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:24:19,383 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product27.cil.c [2025-03-03 14:24:19,406 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e7d7f27d/3cb0c3cc9c9c48b08296551ab682efca/FLAGbf1eae12c [2025-03-03 14:24:19,645 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0e7d7f27d/3cb0c3cc9c9c48b08296551ab682efca [2025-03-03 14:24:19,647 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:24:19,648 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:24:19,649 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:24:19,649 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:24:19,651 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:24:19,652 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:24:19" (1/1) ... [2025-03-03 14:24:19,652 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b79bceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:19, skipping insertion in model container [2025-03-03 14:24:19,652 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:24:19" (1/1) ... [2025-03-03 14:24:19,693 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:24:19,818 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_spec4_product27.cil.c[1542,1555] [2025-03-03 14:24:20,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:24:20,132 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:24:20,138 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [48] [2025-03-03 14:24:20,139 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [57] [2025-03-03 14:24:20,139 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [75] [2025-03-03 14:24:20,139 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [308] [2025-03-03 14:24:20,139 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [357] [2025-03-03 14:24:20,139 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1437] [2025-03-03 14:24:20,139 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1849] [2025-03-03 14:24:20,139 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1948] [2025-03-03 14:24:20,140 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2314] [2025-03-03 14:24:20,140 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2619] [2025-03-03 14:24:20,140 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [2985] [2025-03-03 14:24:20,143 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_spec4_product27.cil.c[1542,1555] [2025-03-03 14:24:20,206 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:24:20,234 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:24:20,235 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:20 WrapperNode [2025-03-03 14:24:20,235 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:24:20,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:24:20,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:24:20,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:24:20,240 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:24:20" (1/1) ... [2025-03-03 14:24:20,255 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:24:20" (1/1) ... [2025-03-03 14:24:20,304 INFO L138 Inliner]: procedures = 133, calls = 208, calls flagged for inlining = 64, calls inlined = 61, statements flattened = 1113 [2025-03-03 14:24:20,304 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:24:20,304 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:24:20,304 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:24:20,304 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:24:20,310 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:20" (1/1) ... [2025-03-03 14:24:20,311 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:20" (1/1) ... [2025-03-03 14:24:20,318 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:20" (1/1) ... [2025-03-03 14:24:20,336 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:24:20,337 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:20" (1/1) ... [2025-03-03 14:24:20,337 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:20" (1/1) ... [2025-03-03 14:24:20,351 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:20" (1/1) ... [2025-03-03 14:24:20,352 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:20" (1/1) ... [2025-03-03 14:24:20,355 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:20" (1/1) ... [2025-03-03 14:24:20,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:20" (1/1) ... [2025-03-03 14:24:20,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:24:20,367 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:24:20,367 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:24:20,367 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:24:20,368 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:20" (1/1) ... [2025-03-03 14:24:20,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:24:20,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:20,393 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:24:20,398 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:24:20,413 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-03 14:24:20,414 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-03 14:24:20,414 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-03 14:24:20,414 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-03 14:24:20,414 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-03 14:24:20,414 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-03 14:24:20,415 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:24:20,415 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:24:20,415 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-03-03 14:24:20,415 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-03-03 14:24:20,415 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:24:20,415 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:24:20,415 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:24:20,415 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:24:20,415 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:24:20,415 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:24:20,415 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:24:20,416 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:24:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:24:20,416 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:24:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:24:20,416 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:24:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-03 14:24:20,416 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-03 14:24:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:24:20,416 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:24:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:24:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:24:20,416 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:24:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-03 14:24:20,416 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-03 14:24:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:24:20,416 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:24:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:24:20,416 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:24:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:24:20,416 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:24:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:24:20,416 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:24:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:24:20,416 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:24:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:24:20,416 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:24:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:24:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:24:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:24:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:24:20,416 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:24:20,417 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:24:20,417 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-03 14:24:20,417 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-03 14:24:20,417 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:24:20,417 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:24:20,589 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:24:20,592 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:24:20,667 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1756: #res := ~retValue_acc~28; [2025-03-03 14:24:20,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1026-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~13#1; [2025-03-03 14:24:20,713 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1071: #res#1 := ~retValue_acc~14#1; [2025-03-03 14:24:20,721 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L979: #res := ~retValue_acc~12; [2025-03-03 14:24:20,729 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1945-1: createEmail_#res#1 := createEmail_~retValue_acc~33#1; [2025-03-03 14:24:20,741 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L523: #res := ~retValue_acc~6; [2025-03-03 14:24:20,816 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1793: #res := ~retValue_acc~29; [2025-03-03 14:24:20,844 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1567: #res := ~retValue_acc~23; [2025-03-03 14:24:20,898 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L849: #res := ~retValue_acc~10; [2025-03-03 14:24:21,067 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2869-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~42#1; [2025-03-03 14:24:21,067 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1367-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~18#1; [2025-03-03 14:24:21,067 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1830-1: isVerified_#res#1 := isVerified_~retValue_acc~30#1; [2025-03-03 14:24:21,067 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1493-1: getEmailId_#res#1 := getEmailId_~retValue_acc~21#1; [2025-03-03 14:24:21,067 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1295-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~17#1; [2025-03-03 14:24:21,067 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L932-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~11#1; [2025-03-03 14:24:21,067 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1414-1: getClientId_#res#1 := getClientId_~retValue_acc~19#1; [2025-03-03 14:24:21,299 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1241-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~16#1; [2025-03-03 14:24:21,299 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2844-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~41#1; [2025-03-03 14:24:21,299 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L354-1: valid_product_#res#1 := valid_product_~retValue_acc~2#1; [2025-03-03 14:24:21,299 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2835-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~40#1; [2025-03-03 14:24:21,299 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1134-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~15#1; [2025-03-03 14:24:21,299 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2826-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~39#1; [2025-03-03 14:24:21,305 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1530: #res := ~retValue_acc~22; [2025-03-03 14:24:21,307 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1921: #res := ~retValue_acc~31; [2025-03-03 14:24:21,439 INFO L? ?]: Removed 565 outVars from TransFormulas that were not future-live. [2025-03-03 14:24:21,439 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:24:21,454 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:24:21,454 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:24:21,455 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:24:21 BoogieIcfgContainer [2025-03-03 14:24:21,455 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:24:21,458 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:24:21,458 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:24:21,461 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:24:21,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:24:19" (1/3) ... [2025-03-03 14:24:21,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17db61ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:24:21, skipping insertion in model container [2025-03-03 14:24:21,462 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:24:20" (2/3) ... [2025-03-03 14:24:21,462 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17db61ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:24:21, skipping insertion in model container [2025-03-03 14:24:21,463 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:24:21" (3/3) ... [2025-03-03 14:24:21,463 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec4_product27.cil.c [2025-03-03 14:24:21,475 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:24:21,477 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec4_product27.cil.c that has 24 procedures, 404 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:24:21,525 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:24:21,536 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;@554b544d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:24:21,536 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:24:21,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 404 states, 319 states have (on average 1.561128526645768) internal successors, (498), 322 states have internal predecessors, (498), 60 states have call successors, (60), 23 states have call predecessors, (60), 23 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-03 14:24:21,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 14:24:21,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:21,555 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] [2025-03-03 14:24:21,555 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:21,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:21,559 INFO L85 PathProgramCache]: Analyzing trace with hash 9783897, now seen corresponding path program 1 times [2025-03-03 14:24:21,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:21,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279848859] [2025-03-03 14:24:21,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:21,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:21,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 14:24:21,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 14:24:21,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:21,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:22,091 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:24:22,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:22,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279848859] [2025-03-03 14:24:22,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279848859] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:22,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474603375] [2025-03-03 14:24:22,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:22,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:22,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:22,094 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:24:22,097 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:24:22,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 14:24:22,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 14:24:22,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:22,352 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:22,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:24:22,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:22,373 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:24:22,373 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:22,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474603375] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:22,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:22,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:24:22,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986588792] [2025-03-03 14:24:22,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:22,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:24:22,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:22,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:24:22,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:24:22,399 INFO L87 Difference]: Start difference. First operand has 404 states, 319 states have (on average 1.561128526645768) internal successors, (498), 322 states have internal predecessors, (498), 60 states have call successors, (60), 23 states have call predecessors, (60), 23 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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:24:22,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:22,455 INFO L93 Difference]: Finished difference Result 611 states and 920 transitions. [2025-03-03 14:24:22,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:24:22,457 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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 101 [2025-03-03 14:24:22,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:22,487 INFO L225 Difference]: With dead ends: 611 [2025-03-03 14:24:22,488 INFO L226 Difference]: Without dead ends: 397 [2025-03-03 14:24:22,492 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 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:24:22,496 INFO L435 NwaCegarLoop]: 615 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, 615 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:24:22,496 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 615 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:22,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-03 14:24:22,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 397. [2025-03-03 14:24:22,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 397 states, 313 states have (on average 1.5591054313099042) internal successors, (488), 315 states have internal predecessors, (488), 60 states have call successors, (60), 23 states have call predecessors, (60), 23 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-03 14:24:22,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 397 states to 397 states and 607 transitions. [2025-03-03 14:24:22,546 INFO L78 Accepts]: Start accepts. Automaton has 397 states and 607 transitions. Word has length 101 [2025-03-03 14:24:22,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:22,547 INFO L471 AbstractCegarLoop]: Abstraction has 397 states and 607 transitions. [2025-03-03 14:24:22,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 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:24:22,548 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 607 transitions. [2025-03-03 14:24:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:24:22,554 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:22,555 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] [2025-03-03 14:24:22,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:22,758 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:24:22,758 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:22,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:22,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1673714323, now seen corresponding path program 1 times [2025-03-03 14:24:22,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:22,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790201049] [2025-03-03 14:24:22,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:22,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:22,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:24:22,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:24:22,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:22,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:22,951 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:24:22,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:22,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790201049] [2025-03-03 14:24:22,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790201049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:22,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434747237] [2025-03-03 14:24:22,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:22,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:22,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:22,958 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:24:22,959 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:24:23,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:24:23,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:24:23,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:23,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:23,242 INFO L256 TraceCheckSpWp]: Trace formula consists of 996 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:24:23,247 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:23,270 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:24:23,270 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:23,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434747237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:23,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:23,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:24:23,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011927574] [2025-03-03 14:24:23,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:23,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:23,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:23,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:23,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:24:23,272 INFO L87 Difference]: Start difference. First operand 397 states and 607 transitions. Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:24:23,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:23,303 INFO L93 Difference]: Finished difference Result 600 states and 898 transitions. [2025-03-03 14:24:23,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:23,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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 102 [2025-03-03 14:24:23,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:23,307 INFO L225 Difference]: With dead ends: 600 [2025-03-03 14:24:23,307 INFO L226 Difference]: Without dead ends: 399 [2025-03-03 14:24:23,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 102 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:24:23,308 INFO L435 NwaCegarLoop]: 606 mSDtfsCounter, 0 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1210 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:24:23,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1210 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:23,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-03-03 14:24:23,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 399. [2025-03-03 14:24:23,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 399 states, 315 states have (on average 1.5555555555555556) internal successors, (490), 317 states have internal predecessors, (490), 60 states have call successors, (60), 23 states have call predecessors, (60), 23 states have return successors, (59), 58 states have call predecessors, (59), 59 states have call successors, (59) [2025-03-03 14:24:23,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 609 transitions. [2025-03-03 14:24:23,341 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 609 transitions. Word has length 102 [2025-03-03 14:24:23,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:23,342 INFO L471 AbstractCegarLoop]: Abstraction has 399 states and 609 transitions. [2025-03-03 14:24:23,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 3 states have internal predecessors, (55), 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:24:23,342 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 609 transitions. [2025-03-03 14:24:23,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:24:23,347 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:23,347 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] [2025-03-03 14:24:23,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:23,552 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:24:23,552 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:23,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:23,553 INFO L85 PathProgramCache]: Analyzing trace with hash -171635735, now seen corresponding path program 1 times [2025-03-03 14:24:23,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:23,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963240605] [2025-03-03 14:24:23,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:23,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:23,573 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:24:23,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:24:23,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:23,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:23,761 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:24:23,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:23,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963240605] [2025-03-03 14:24:23,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963240605] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:23,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [506005808] [2025-03-03 14:24:23,764 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:23,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:23,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:23,766 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:24:23,768 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:24:23,899 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:24:23,996 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:24:23,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:23,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:24,001 INFO L256 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:24:24,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:24,027 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:24:24,031 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:24,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [506005808] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:24,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:24,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:24:24,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306071854] [2025-03-03 14:24:24,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:24,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:24,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:24,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:24,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:24:24,035 INFO L87 Difference]: Start difference. First operand 399 states and 609 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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:24:24,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:24,077 INFO L93 Difference]: Finished difference Result 850 states and 1317 transitions. [2025-03-03 14:24:24,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:24,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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 110 [2025-03-03 14:24:24,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:24,081 INFO L225 Difference]: With dead ends: 850 [2025-03-03 14:24:24,081 INFO L226 Difference]: Without dead ends: 478 [2025-03-03 14:24:24,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 110 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:24:24,086 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 142 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1185 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:24:24,086 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1185 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:24,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2025-03-03 14:24:24,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 470. [2025-03-03 14:24:24,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 470 states, 372 states have (on average 1.575268817204301) internal successors, (586), 374 states have internal predecessors, (586), 74 states have call successors, (74), 23 states have call predecessors, (74), 23 states have return successors, (73), 72 states have call predecessors, (73), 73 states have call successors, (73) [2025-03-03 14:24:24,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 733 transitions. [2025-03-03 14:24:24,112 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 733 transitions. Word has length 110 [2025-03-03 14:24:24,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:24,113 INFO L471 AbstractCegarLoop]: Abstraction has 470 states and 733 transitions. [2025-03-03 14:24:24,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 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:24:24,114 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 733 transitions. [2025-03-03 14:24:24,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-03-03 14:24:24,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:24,117 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] [2025-03-03 14:24:24,125 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:24,317 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:24:24,318 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:24,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:24,319 INFO L85 PathProgramCache]: Analyzing trace with hash 384249371, now seen corresponding path program 1 times [2025-03-03 14:24:24,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:24,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538898757] [2025-03-03 14:24:24,319 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:24,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:24,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:24:24,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:24:24,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:24,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:24,475 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:24:24,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:24,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538898757] [2025-03-03 14:24:24,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538898757] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:24,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [48376302] [2025-03-03 14:24:24,476 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:24,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:24,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:24,478 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:24:24,480 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:24:24,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-03-03 14:24:24,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-03-03 14:24:24,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:24,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:24,701 INFO L256 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:24:24,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:24,747 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:24:24,748 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:24,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [48376302] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:24,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:24,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:24:24,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836585482] [2025-03-03 14:24:24,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:24,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:24,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:24,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:24,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:24,750 INFO L87 Difference]: Start difference. First operand 470 states and 733 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (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:24:24,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:24,805 INFO L93 Difference]: Finished difference Result 931 states and 1456 transitions. [2025-03-03 14:24:24,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:24,806 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (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 111 [2025-03-03 14:24:24,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:24,808 INFO L225 Difference]: With dead ends: 931 [2025-03-03 14:24:24,808 INFO L226 Difference]: Without dead ends: 472 [2025-03-03 14:24:24,809 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 109 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:24:24,810 INFO L435 NwaCegarLoop]: 599 mSDtfsCounter, 2 mSDsluCounter, 1786 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2385 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:24:24,810 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2385 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:24,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2025-03-03 14:24:24,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 472. [2025-03-03 14:24:24,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 472 states, 373 states have (on average 1.5737265415549597) internal successors, (587), 376 states have internal predecessors, (587), 74 states have call successors, (74), 23 states have call predecessors, (74), 24 states have return successors, (75), 72 states have call predecessors, (75), 73 states have call successors, (75) [2025-03-03 14:24:24,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 736 transitions. [2025-03-03 14:24:24,824 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 736 transitions. Word has length 111 [2025-03-03 14:24:24,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:24,824 INFO L471 AbstractCegarLoop]: Abstraction has 472 states and 736 transitions. [2025-03-03 14:24:24,824 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (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:24:24,824 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 736 transitions. [2025-03-03 14:24:24,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-03 14:24:24,826 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:24,826 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] [2025-03-03 14:24:24,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:24:25,026 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:24:25,027 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:25,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:25,027 INFO L85 PathProgramCache]: Analyzing trace with hash 1141512341, now seen corresponding path program 1 times [2025-03-03 14:24:25,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:25,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569435770] [2025-03-03 14:24:25,027 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:25,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:25,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:24:25,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:24:25,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:25,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:25,201 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:24:25,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:25,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569435770] [2025-03-03 14:24:25,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569435770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:25,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196683888] [2025-03-03 14:24:25,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:25,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:25,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:25,207 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:24:25,209 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:24:25,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-03 14:24:25,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-03 14:24:25,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:25,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:25,428 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:24:25,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:25,477 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:24:25,477 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:25,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196683888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:25,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:25,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:24:25,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707016083] [2025-03-03 14:24:25,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:25,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:25,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:25,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:25,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:24:25,481 INFO L87 Difference]: Start difference. First operand 472 states and 736 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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:24:25,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:25,540 INFO L93 Difference]: Finished difference Result 933 states and 1461 transitions. [2025-03-03 14:24:25,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:25,540 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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 112 [2025-03-03 14:24:25,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:25,543 INFO L225 Difference]: With dead ends: 933 [2025-03-03 14:24:25,544 INFO L226 Difference]: Without dead ends: 474 [2025-03-03 14:24:25,546 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 110 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:24:25,547 INFO L435 NwaCegarLoop]: 597 mSDtfsCounter, 2 mSDsluCounter, 1774 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2371 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:24:25,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2371 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:25,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-03-03 14:24:25,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2025-03-03 14:24:25,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 374 states have (on average 1.572192513368984) internal successors, (588), 378 states have internal predecessors, (588), 74 states have call successors, (74), 23 states have call predecessors, (74), 25 states have return successors, (80), 72 states have call predecessors, (80), 73 states have call successors, (80) [2025-03-03 14:24:25,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 742 transitions. [2025-03-03 14:24:25,563 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 742 transitions. Word has length 112 [2025-03-03 14:24:25,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:25,563 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 742 transitions. [2025-03-03 14:24:25,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 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:24:25,563 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 742 transitions. [2025-03-03 14:24:25,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:24:25,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:25,565 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] [2025-03-03 14:24:25,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:25,766 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:24:25,766 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:25,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:25,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1230170527, now seen corresponding path program 1 times [2025-03-03 14:24:25,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:25,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674620929] [2025-03-03 14:24:25,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:25,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:25,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:24:25,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:24:25,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:25,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:25,911 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:24:25,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:25,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674620929] [2025-03-03 14:24:25,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674620929] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:25,912 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:25,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:24:25,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666842040] [2025-03-03 14:24:25,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:25,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:25,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:25,913 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:25,914 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:24:25,914 INFO L87 Difference]: Start difference. First operand 474 states and 742 transitions. Second operand has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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:24:25,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:25,955 INFO L93 Difference]: Finished difference Result 925 states and 1452 transitions. [2025-03-03 14:24:25,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:25,956 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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 113 [2025-03-03 14:24:25,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:25,959 INFO L225 Difference]: With dead ends: 925 [2025-03-03 14:24:25,959 INFO L226 Difference]: Without dead ends: 474 [2025-03-03 14:24:25,960 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:24:25,961 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 2 mSDsluCounter, 1789 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2389 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:24:25,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2389 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:25,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2025-03-03 14:24:25,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 474. [2025-03-03 14:24:25,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 474 states, 374 states have (on average 1.572192513368984) internal successors, (588), 378 states have internal predecessors, (588), 74 states have call successors, (74), 23 states have call predecessors, (74), 25 states have return successors, (79), 72 states have call predecessors, (79), 73 states have call successors, (79) [2025-03-03 14:24:25,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 741 transitions. [2025-03-03 14:24:25,976 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 741 transitions. Word has length 113 [2025-03-03 14:24:25,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:25,977 INFO L471 AbstractCegarLoop]: Abstraction has 474 states and 741 transitions. [2025-03-03 14:24:25,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 17.5) internal successors, (70), 5 states have internal predecessors, (70), 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:24:25,977 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 741 transitions. [2025-03-03 14:24:25,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:24:25,979 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:25,979 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] [2025-03-03 14:24:25,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:24:25,979 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:25,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:25,979 INFO L85 PathProgramCache]: Analyzing trace with hash 2048676411, now seen corresponding path program 2 times [2025-03-03 14:24:25,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:25,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277177189] [2025-03-03 14:24:25,980 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:24:25,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:25,995 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 114 statements into 2 equivalence classes. [2025-03-03 14:24:26,001 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 46 of 114 statements. [2025-03-03 14:24:26,001 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:24:26,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:26,108 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:24:26,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:26,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277177189] [2025-03-03 14:24:26,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277177189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:26,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:26,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:24:26,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152819588] [2025-03-03 14:24:26,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:26,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:24:26,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:26,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:24:26,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:26,109 INFO L87 Difference]: Start difference. First operand 474 states and 741 transitions. Second operand has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:24:26,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:26,461 INFO L93 Difference]: Finished difference Result 957 states and 1504 transitions. [2025-03-03 14:24:26,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:24:26,461 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 114 [2025-03-03 14:24:26,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:26,468 INFO L225 Difference]: With dead ends: 957 [2025-03-03 14:24:26,468 INFO L226 Difference]: Without dead ends: 953 [2025-03-03 14:24:26,469 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:24:26,470 INFO L435 NwaCegarLoop]: 621 mSDtfsCounter, 1030 mSDsluCounter, 2933 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1032 SdHoareTripleChecker+Valid, 3554 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:26,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1032 Valid, 3554 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:24:26,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-03-03 14:24:26,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 943. [2025-03-03 14:24:26,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 746 states have (on average 1.5764075067024128) internal successors, (1176), 751 states have internal predecessors, (1176), 146 states have call successors, (146), 47 states have call predecessors, (146), 50 states have return successors, (160), 144 states have call predecessors, (160), 144 states have call successors, (160) [2025-03-03 14:24:26,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1482 transitions. [2025-03-03 14:24:26,515 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1482 transitions. Word has length 114 [2025-03-03 14:24:26,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:26,515 INFO L471 AbstractCegarLoop]: Abstraction has 943 states and 1482 transitions. [2025-03-03 14:24:26,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.0) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:24:26,516 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1482 transitions. [2025-03-03 14:24:26,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:24:26,519 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:26,519 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] [2025-03-03 14:24:26,519 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:24:26,519 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:26,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:26,520 INFO L85 PathProgramCache]: Analyzing trace with hash -1584821793, now seen corresponding path program 1 times [2025-03-03 14:24:26,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:26,520 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882650485] [2025-03-03 14:24:26,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:26,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:26,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:24:26,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:24:26,542 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:26,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:26,636 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:24:26,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:26,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882650485] [2025-03-03 14:24:26,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882650485] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:26,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:26,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:24:26,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806299632] [2025-03-03 14:24:26,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:26,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:26,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:26,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:26,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:24:26,638 INFO L87 Difference]: Start difference. First operand 943 states and 1482 transitions. Second operand has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 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:24:26,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:26,716 INFO L93 Difference]: Finished difference Result 1855 states and 2924 transitions. [2025-03-03 14:24:26,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:26,717 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 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 115 [2025-03-03 14:24:26,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:26,723 INFO L225 Difference]: With dead ends: 1855 [2025-03-03 14:24:26,723 INFO L226 Difference]: Without dead ends: 947 [2025-03-03 14:24:26,726 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:24:26,727 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 1 mSDsluCounter, 1791 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2392 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:24:26,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2392 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:26,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 947 states. [2025-03-03 14:24:26,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 947 to 947. [2025-03-03 14:24:26,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 748 states have (on average 1.5748663101604279) internal successors, (1178), 755 states have internal predecessors, (1178), 146 states have call successors, (146), 47 states have call predecessors, (146), 52 states have return successors, (163), 144 states have call predecessors, (163), 144 states have call successors, (163) [2025-03-03 14:24:26,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1487 transitions. [2025-03-03 14:24:26,769 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1487 transitions. Word has length 115 [2025-03-03 14:24:26,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:26,770 INFO L471 AbstractCegarLoop]: Abstraction has 947 states and 1487 transitions. [2025-03-03 14:24:26,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.25) internal successors, (73), 5 states have internal predecessors, (73), 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:24:26,770 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1487 transitions. [2025-03-03 14:24:26,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:24:26,774 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:26,774 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] [2025-03-03 14:24:26,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:24:26,774 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:26,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:26,775 INFO L85 PathProgramCache]: Analyzing trace with hash -493095592, now seen corresponding path program 1 times [2025-03-03 14:24:26,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:26,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499503484] [2025-03-03 14:24:26,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:26,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:26,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:24:26,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:24:26,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:26,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:26,879 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:24:26,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:26,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499503484] [2025-03-03 14:24:26,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499503484] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:26,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:26,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:24:26,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364872452] [2025-03-03 14:24:26,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:26,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:24:26,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:26,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:24:26,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:26,881 INFO L87 Difference]: Start difference. First operand 947 states and 1487 transitions. Second operand has 8 states, 7 states have (on average 11.0) internal successors, (77), 8 states have internal predecessors, (77), 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:24:26,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:26,994 INFO L93 Difference]: Finished difference Result 1853 states and 2916 transitions. [2025-03-03 14:24:26,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:24:26,995 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 8 states have internal predecessors, (77), 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 116 [2025-03-03 14:24:26,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:27,000 INFO L225 Difference]: With dead ends: 1853 [2025-03-03 14:24:27,000 INFO L226 Difference]: Without dead ends: 951 [2025-03-03 14:24:27,003 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:24:27,003 INFO L435 NwaCegarLoop]: 591 mSDtfsCounter, 7 mSDsluCounter, 3517 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4108 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:24:27,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4108 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:24:27,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-03-03 14:24:27,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 949. [2025-03-03 14:24:27,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 949 states, 750 states have (on average 1.5733333333333333) internal successors, (1180), 756 states have internal predecessors, (1180), 146 states have call successors, (146), 48 states have call predecessors, (146), 52 states have return successors, (161), 144 states have call predecessors, (161), 144 states have call successors, (161) [2025-03-03 14:24:27,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 949 states to 949 states and 1487 transitions. [2025-03-03 14:24:27,050 INFO L78 Accepts]: Start accepts. Automaton has 949 states and 1487 transitions. Word has length 116 [2025-03-03 14:24:27,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:27,051 INFO L471 AbstractCegarLoop]: Abstraction has 949 states and 1487 transitions. [2025-03-03 14:24:27,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.0) internal successors, (77), 8 states have internal predecessors, (77), 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:24:27,051 INFO L276 IsEmpty]: Start isEmpty. Operand 949 states and 1487 transitions. [2025-03-03 14:24:27,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:24:27,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:27,055 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] [2025-03-03 14:24:27,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:24:27,055 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:27,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:27,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1885625242, now seen corresponding path program 2 times [2025-03-03 14:24:27,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:27,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730803138] [2025-03-03 14:24:27,056 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:24:27,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:27,069 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 117 statements into 2 equivalence classes. [2025-03-03 14:24:27,073 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 117 statements. [2025-03-03 14:24:27,074 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:24:27,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:27,142 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:24:27,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:27,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730803138] [2025-03-03 14:24:27,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730803138] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:27,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:27,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:24:27,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474164732] [2025-03-03 14:24:27,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:27,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:24:27,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:27,144 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:24:27,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:27,144 INFO L87 Difference]: Start difference. First operand 949 states and 1487 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:24:27,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:27,508 INFO L93 Difference]: Finished difference Result 1895 states and 2994 transitions. [2025-03-03 14:24:27,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:24:27,508 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2025-03-03 14:24:27,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:27,518 INFO L225 Difference]: With dead ends: 1895 [2025-03-03 14:24:27,518 INFO L226 Difference]: Without dead ends: 1893 [2025-03-03 14:24:27,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2025-03-03 14:24:27,519 INFO L435 NwaCegarLoop]: 612 mSDtfsCounter, 553 mSDsluCounter, 3412 mSDsCounter, 0 mSdLazyCounter, 371 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 4024 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:27,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 4024 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 371 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:24:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1893 states. [2025-03-03 14:24:27,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1893 to 1869. [2025-03-03 14:24:27,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1869 states, 1481 states have (on average 1.5793382849426063) internal successors, (2339), 1494 states have internal predecessors, (2339), 282 states have call successors, (282), 94 states have call predecessors, (282), 105 states have return successors, (334), 280 states have call predecessors, (334), 278 states have call successors, (334) [2025-03-03 14:24:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1869 states to 1869 states and 2955 transitions. [2025-03-03 14:24:27,625 INFO L78 Accepts]: Start accepts. Automaton has 1869 states and 2955 transitions. Word has length 117 [2025-03-03 14:24:27,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:27,625 INFO L471 AbstractCegarLoop]: Abstraction has 1869 states and 2955 transitions. [2025-03-03 14:24:27,625 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 7 states have internal predecessors, (76), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:24:27,626 INFO L276 IsEmpty]: Start isEmpty. Operand 1869 states and 2955 transitions. [2025-03-03 14:24:27,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:24:27,631 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:27,632 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:27,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 14:24:27,632 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:27,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:27,633 INFO L85 PathProgramCache]: Analyzing trace with hash 66150344, now seen corresponding path program 1 times [2025-03-03 14:24:27,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:27,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255703886] [2025-03-03 14:24:27,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:27,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:27,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:24:27,658 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:24:27,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:27,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:27,741 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:24:27,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:27,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255703886] [2025-03-03 14:24:27,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255703886] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:27,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1072134989] [2025-03-03 14:24:27,743 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:27,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:27,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:27,745 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:24:27,746 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:24:27,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:24:27,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:24:27,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:27,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:27,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 1032 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:24:27,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:28,010 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 14:24:28,010 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:28,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1072134989] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:28,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:28,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:24:28,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737288838] [2025-03-03 14:24:28,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:28,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:28,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:28,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:28,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:28,011 INFO L87 Difference]: Start difference. First operand 1869 states and 2955 transitions. Second operand has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:24:28,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:28,098 INFO L93 Difference]: Finished difference Result 2821 states and 4451 transitions. [2025-03-03 14:24:28,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:28,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 117 [2025-03-03 14:24:28,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:28,110 INFO L225 Difference]: With dead ends: 2821 [2025-03-03 14:24:28,111 INFO L226 Difference]: Without dead ends: 1883 [2025-03-03 14:24:28,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 115 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:24:28,116 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 1 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2382 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:28,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2382 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:28,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1883 states. [2025-03-03 14:24:28,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1883 to 1871. [2025-03-03 14:24:28,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1871 states, 1482 states have (on average 1.5789473684210527) internal successors, (2340), 1496 states have internal predecessors, (2340), 282 states have call successors, (282), 94 states have call predecessors, (282), 106 states have return successors, (336), 280 states have call predecessors, (336), 278 states have call successors, (336) [2025-03-03 14:24:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1871 states to 1871 states and 2958 transitions. [2025-03-03 14:24:28,197 INFO L78 Accepts]: Start accepts. Automaton has 1871 states and 2958 transitions. Word has length 117 [2025-03-03 14:24:28,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:28,198 INFO L471 AbstractCegarLoop]: Abstraction has 1871 states and 2958 transitions. [2025-03-03 14:24:28,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.8) internal successors, (74), 5 states have internal predecessors, (74), 2 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-03-03 14:24:28,198 INFO L276 IsEmpty]: Start isEmpty. Operand 1871 states and 2958 transitions. [2025-03-03 14:24:28,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:24:28,204 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:28,204 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:24:28,212 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:28,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:28,405 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:28,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:28,405 INFO L85 PathProgramCache]: Analyzing trace with hash 204148349, now seen corresponding path program 1 times [2025-03-03 14:24:28,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:28,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328627873] [2025-03-03 14:24:28,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:28,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:28,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:24:28,423 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:24:28,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:28,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:28,509 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:24:28,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:28,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328627873] [2025-03-03 14:24:28,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328627873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:28,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:28,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:24:28,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287100050] [2025-03-03 14:24:28,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:28,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:24:28,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:28,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:24:28,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:28,511 INFO L87 Difference]: Start difference. First operand 1871 states and 2958 transitions. Second operand has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 8 states have internal predecessors, (79), 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:24:28,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:28,635 INFO L93 Difference]: Finished difference Result 2783 states and 4396 transitions. [2025-03-03 14:24:28,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:24:28,636 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 8 states have internal predecessors, (79), 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 118 [2025-03-03 14:24:28,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:28,641 INFO L225 Difference]: With dead ends: 2783 [2025-03-03 14:24:28,642 INFO L226 Difference]: Without dead ends: 961 [2025-03-03 14:24:28,646 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:24:28,647 INFO L435 NwaCegarLoop]: 593 mSDtfsCounter, 5 mSDsluCounter, 3529 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4122 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:28,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4122 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:24:28,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2025-03-03 14:24:28,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 959. [2025-03-03 14:24:28,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 959 states, 757 states have (on average 1.5680317040951124) internal successors, (1187), 765 states have internal predecessors, (1187), 146 states have call successors, (146), 49 states have call predecessors, (146), 55 states have return successors, (170), 144 states have call predecessors, (170), 144 states have call successors, (170) [2025-03-03 14:24:28,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 959 states to 959 states and 1503 transitions. [2025-03-03 14:24:28,677 INFO L78 Accepts]: Start accepts. Automaton has 959 states and 1503 transitions. Word has length 118 [2025-03-03 14:24:28,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:28,677 INFO L471 AbstractCegarLoop]: Abstraction has 959 states and 1503 transitions. [2025-03-03 14:24:28,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.285714285714286) internal successors, (79), 8 states have internal predecessors, (79), 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:24:28,678 INFO L276 IsEmpty]: Start isEmpty. Operand 959 states and 1503 transitions. [2025-03-03 14:24:28,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:24:28,680 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:28,681 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] [2025-03-03 14:24:28,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:24:28,681 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:28,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:28,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1321034037, now seen corresponding path program 1 times [2025-03-03 14:24:28,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:28,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261754768] [2025-03-03 14:24:28,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:28,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:28,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:24:28,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:24:28,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:28,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:28,819 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:24:28,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:28,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261754768] [2025-03-03 14:24:28,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261754768] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:28,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855459091] [2025-03-03 14:24:28,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:28,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:28,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:28,822 INFO L229 MonitoredProcess]: Starting monitored process 8 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:24:28,824 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:24:28,956 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:24:29,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:24:29,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:29,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:29,042 INFO L256 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:24:29,045 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:29,079 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:24:29,082 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:24:29,162 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:24:29,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855459091] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:24:29,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:24:29,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-03 14:24:29,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187188877] [2025-03-03 14:24:29,163 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:24:29,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:24:29,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:29,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:24:29,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:24:29,164 INFO L87 Difference]: Start difference. First operand 959 states and 1503 transitions. Second operand has 11 states, 10 states have (on average 12.4) internal successors, (124), 11 states have internal predecessors, (124), 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:24:29,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:29,714 INFO L93 Difference]: Finished difference Result 2789 states and 4557 transitions. [2025-03-03 14:24:29,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:24:29,715 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 12.4) internal successors, (124), 11 states have internal predecessors, (124), 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 118 [2025-03-03 14:24:29,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:29,724 INFO L225 Difference]: With dead ends: 2789 [2025-03-03 14:24:29,724 INFO L226 Difference]: Without dead ends: 1885 [2025-03-03 14:24:29,727 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 233 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:24:29,727 INFO L435 NwaCegarLoop]: 602 mSDtfsCounter, 1627 mSDsluCounter, 3238 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1627 SdHoareTripleChecker+Valid, 3840 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:29,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1627 Valid, 3840 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:24:29,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1885 states. [2025-03-03 14:24:29,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1885 to 1837. [2025-03-03 14:24:29,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1837 states, 1477 states have (on average 1.6188219363574814) internal successors, (2391), 1484 states have internal predecessors, (2391), 304 states have call successors, (304), 50 states have call predecessors, (304), 55 states have return successors, (353), 302 states have call predecessors, (353), 302 states have call successors, (353) [2025-03-03 14:24:29,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1837 states to 1837 states and 3048 transitions. [2025-03-03 14:24:29,798 INFO L78 Accepts]: Start accepts. Automaton has 1837 states and 3048 transitions. Word has length 118 [2025-03-03 14:24:29,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:29,799 INFO L471 AbstractCegarLoop]: Abstraction has 1837 states and 3048 transitions. [2025-03-03 14:24:29,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 12.4) internal successors, (124), 11 states have internal predecessors, (124), 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:24:29,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1837 states and 3048 transitions. [2025-03-03 14:24:29,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:24:29,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:29,806 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:29,813 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:30,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:30,007 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:30,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:30,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1086238834, now seen corresponding path program 1 times [2025-03-03 14:24:30,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:30,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1459389523] [2025-03-03 14:24:30,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:30,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:30,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:24:30,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:24:30,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:30,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:30,059 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:24:30,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:30,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1459389523] [2025-03-03 14:24:30,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1459389523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:30,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:30,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:30,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509106399] [2025-03-03 14:24:30,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:30,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:30,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:30,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:30,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:30,061 INFO L87 Difference]: Start difference. First operand 1837 states and 3048 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (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:24:30,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:30,121 INFO L93 Difference]: Finished difference Result 4361 states and 7349 transitions. [2025-03-03 14:24:30,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:30,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (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 121 [2025-03-03 14:24:30,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:30,136 INFO L225 Difference]: With dead ends: 4361 [2025-03-03 14:24:30,136 INFO L226 Difference]: Without dead ends: 2673 [2025-03-03 14:24:30,142 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:24:30,143 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 139 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1210 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:24:30,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1210 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:30,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2673 states. [2025-03-03 14:24:30,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2673 to 2657. [2025-03-03 14:24:30,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2657 states, 2139 states have (on average 1.6367461430575034) internal successors, (3501), 2146 states have internal predecessors, (3501), 462 states have call successors, (462), 50 states have call predecessors, (462), 55 states have return successors, (536), 460 states have call predecessors, (536), 460 states have call successors, (536) [2025-03-03 14:24:30,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2657 states to 2657 states and 4499 transitions. [2025-03-03 14:24:30,276 INFO L78 Accepts]: Start accepts. Automaton has 2657 states and 4499 transitions. Word has length 121 [2025-03-03 14:24:30,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:30,277 INFO L471 AbstractCegarLoop]: Abstraction has 2657 states and 4499 transitions. [2025-03-03 14:24:30,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (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:24:30,277 INFO L276 IsEmpty]: Start isEmpty. Operand 2657 states and 4499 transitions. [2025-03-03 14:24:30,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 14:24:30,290 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:30,290 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:30,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:24:30,290 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:30,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:30,290 INFO L85 PathProgramCache]: Analyzing trace with hash -1779003731, now seen corresponding path program 1 times [2025-03-03 14:24:30,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:30,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425978888] [2025-03-03 14:24:30,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:30,291 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:30,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:24:30,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:24:30,317 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:30,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:30,349 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:24:30,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:30,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425978888] [2025-03-03 14:24:30,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425978888] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:30,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:30,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:30,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971560230] [2025-03-03 14:24:30,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:30,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:30,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:30,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:30,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:30,352 INFO L87 Difference]: Start difference. First operand 2657 states and 4499 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (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:24:30,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:30,446 INFO L93 Difference]: Finished difference Result 6417 states and 10946 transitions. [2025-03-03 14:24:30,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:30,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (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 122 [2025-03-03 14:24:30,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:30,468 INFO L225 Difference]: With dead ends: 6417 [2025-03-03 14:24:30,469 INFO L226 Difference]: Without dead ends: 4011 [2025-03-03 14:24:30,479 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:24:30,480 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 137 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1206 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:24:30,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1206 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:30,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4011 states. [2025-03-03 14:24:30,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4011 to 3995. [2025-03-03 14:24:30,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3995 states, 3239 states have (on average 1.6452608829885766) internal successors, (5329), 3246 states have internal predecessors, (5329), 700 states have call successors, (700), 50 states have call predecessors, (700), 55 states have return successors, (790), 698 states have call predecessors, (790), 698 states have call successors, (790) [2025-03-03 14:24:30,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3995 states to 3995 states and 6819 transitions. [2025-03-03 14:24:30,691 INFO L78 Accepts]: Start accepts. Automaton has 3995 states and 6819 transitions. Word has length 122 [2025-03-03 14:24:30,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:30,692 INFO L471 AbstractCegarLoop]: Abstraction has 3995 states and 6819 transitions. [2025-03-03 14:24:30,692 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (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:24:30,692 INFO L276 IsEmpty]: Start isEmpty. Operand 3995 states and 6819 transitions. [2025-03-03 14:24:30,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:24:30,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:30,712 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:30,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:24:30,712 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:30,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:30,713 INFO L85 PathProgramCache]: Analyzing trace with hash 1738377361, now seen corresponding path program 1 times [2025-03-03 14:24:30,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:30,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796599738] [2025-03-03 14:24:30,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:30,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:30,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:24:30,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:24:30,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:30,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:30,761 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:24:30,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:30,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796599738] [2025-03-03 14:24:30,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796599738] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:30,762 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:30,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:30,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237637760] [2025-03-03 14:24:30,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:30,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:30,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:30,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:30,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:30,764 INFO L87 Difference]: Start difference. First operand 3995 states and 6819 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (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:24:30,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:30,909 INFO L93 Difference]: Finished difference Result 9551 states and 16434 transitions. [2025-03-03 14:24:30,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:30,909 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (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 123 [2025-03-03 14:24:30,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:30,947 INFO L225 Difference]: With dead ends: 9551 [2025-03-03 14:24:30,947 INFO L226 Difference]: Without dead ends: 6071 [2025-03-03 14:24:30,960 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:24:30,960 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 135 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1201 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:24:30,961 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1201 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:30,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6071 states. [2025-03-03 14:24:31,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6071 to 6055. [2025-03-03 14:24:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6055 states, 4975 states have (on average 1.6520603015075377) internal successors, (8219), 4982 states have internal predecessors, (8219), 1024 states have call successors, (1024), 50 states have call predecessors, (1024), 55 states have return successors, (1164), 1022 states have call predecessors, (1164), 1022 states have call successors, (1164) [2025-03-03 14:24:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6055 states to 6055 states and 10407 transitions. [2025-03-03 14:24:31,217 INFO L78 Accepts]: Start accepts. Automaton has 6055 states and 10407 transitions. Word has length 123 [2025-03-03 14:24:31,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:31,217 INFO L471 AbstractCegarLoop]: Abstraction has 6055 states and 10407 transitions. [2025-03-03 14:24:31,218 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (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:24:31,219 INFO L276 IsEmpty]: Start isEmpty. Operand 6055 states and 10407 transitions. [2025-03-03 14:24:31,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-03 14:24:31,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:31,239 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:31,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:24:31,240 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:31,240 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:31,240 INFO L85 PathProgramCache]: Analyzing trace with hash 803049518, now seen corresponding path program 1 times [2025-03-03 14:24:31,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:31,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1652717539] [2025-03-03 14:24:31,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:31,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:31,254 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-03 14:24:31,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-03 14:24:31,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:31,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:31,282 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:24:31,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:31,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1652717539] [2025-03-03 14:24:31,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1652717539] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:31,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:31,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:31,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998229659] [2025-03-03 14:24:31,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:31,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:31,284 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:31,284 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:31,285 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:31,285 INFO L87 Difference]: Start difference. First operand 6055 states and 10407 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (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:24:31,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:31,499 INFO L93 Difference]: Finished difference Result 14517 states and 25140 transitions. [2025-03-03 14:24:31,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:31,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (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 124 [2025-03-03 14:24:31,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:31,543 INFO L225 Difference]: With dead ends: 14517 [2025-03-03 14:24:31,543 INFO L226 Difference]: Without dead ends: 9407 [2025-03-03 14:24:31,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:31,561 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 133 mSDsluCounter, 596 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1201 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:24:31,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1201 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:31,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9407 states. [2025-03-03 14:24:31,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9407 to 9391. [2025-03-03 14:24:31,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9391 states, 7821 states have (on average 1.6569492392277203) internal successors, (12959), 7828 states have internal predecessors, (12959), 1514 states have call successors, (1514), 50 states have call predecessors, (1514), 55 states have return successors, (1737), 1512 states have call predecessors, (1737), 1512 states have call successors, (1737) [2025-03-03 14:24:32,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9391 states to 9391 states and 16210 transitions. [2025-03-03 14:24:32,018 INFO L78 Accepts]: Start accepts. Automaton has 9391 states and 16210 transitions. Word has length 124 [2025-03-03 14:24:32,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:32,018 INFO L471 AbstractCegarLoop]: Abstraction has 9391 states and 16210 transitions. [2025-03-03 14:24:32,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (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:24:32,019 INFO L276 IsEmpty]: Start isEmpty. Operand 9391 states and 16210 transitions. [2025-03-03 14:24:32,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-03 14:24:32,046 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:32,046 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:32,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:24:32,047 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:32,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:32,048 INFO L85 PathProgramCache]: Analyzing trace with hash -1142724144, now seen corresponding path program 1 times [2025-03-03 14:24:32,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:32,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644391843] [2025-03-03 14:24:32,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:32,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:32,064 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-03-03 14:24:32,074 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-03-03 14:24:32,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:32,075 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:32,104 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:24:32,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:32,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644391843] [2025-03-03 14:24:32,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644391843] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:32,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:32,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:32,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42363671] [2025-03-03 14:24:32,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:32,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:32,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:32,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:32,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:32,106 INFO L87 Difference]: Start difference. First operand 9391 states and 16210 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (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:24:32,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:32,390 INFO L93 Difference]: Finished difference Result 22807 states and 39673 transitions. [2025-03-03 14:24:32,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:32,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (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 125 [2025-03-03 14:24:32,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:32,450 INFO L225 Difference]: With dead ends: 22807 [2025-03-03 14:24:32,451 INFO L226 Difference]: Without dead ends: 15015 [2025-03-03 14:24:32,484 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:24:32,485 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 131 mSDsluCounter, 595 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1211 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:24:32,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1211 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:32,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15015 states. [2025-03-03 14:24:32,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15015 to 14999. [2025-03-03 14:24:32,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14999 states, 12443 states have (on average 1.6554689383589167) internal successors, (20599), 12450 states have internal predecessors, (20599), 2500 states have call successors, (2500), 50 states have call predecessors, (2500), 55 states have return successors, (2867), 2498 states have call predecessors, (2867), 2498 states have call successors, (2867) [2025-03-03 14:24:32,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14999 states to 14999 states and 25966 transitions. [2025-03-03 14:24:32,999 INFO L78 Accepts]: Start accepts. Automaton has 14999 states and 25966 transitions. Word has length 125 [2025-03-03 14:24:32,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:32,999 INFO L471 AbstractCegarLoop]: Abstraction has 14999 states and 25966 transitions. [2025-03-03 14:24:32,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (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:24:33,000 INFO L276 IsEmpty]: Start isEmpty. Operand 14999 states and 25966 transitions. [2025-03-03 14:24:33,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 14:24:33,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:33,028 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:33,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:24:33,028 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:33,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:33,029 INFO L85 PathProgramCache]: Analyzing trace with hash -2015205457, now seen corresponding path program 1 times [2025-03-03 14:24:33,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:33,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285876586] [2025-03-03 14:24:33,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:33,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:33,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:24:33,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:24:33,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:33,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:33,072 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:24:33,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:33,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285876586] [2025-03-03 14:24:33,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285876586] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:33,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:33,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:33,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668734072] [2025-03-03 14:24:33,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:33,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:33,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:33,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:33,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:33,075 INFO L87 Difference]: Start difference. First operand 14999 states and 25966 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:24:33,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:33,614 INFO L93 Difference]: Finished difference Result 37827 states and 65865 transitions. [2025-03-03 14:24:33,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:33,614 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 126 [2025-03-03 14:24:33,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:33,722 INFO L225 Difference]: With dead ends: 37827 [2025-03-03 14:24:33,722 INFO L226 Difference]: Without dead ends: 25219 [2025-03-03 14:24:33,756 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:24:33,757 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 129 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1206 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:24:33,757 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1206 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:33,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25219 states. [2025-03-03 14:24:34,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25219 to 25203. [2025-03-03 14:24:34,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25203 states, 21003 states have (on average 1.656001523591868) internal successors, (34781), 21010 states have internal predecessors, (34781), 4144 states have call successors, (4144), 50 states have call predecessors, (4144), 55 states have return successors, (4700), 4142 states have call predecessors, (4700), 4142 states have call successors, (4700) [2025-03-03 14:24:34,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25203 states to 25203 states and 43625 transitions. [2025-03-03 14:24:34,848 INFO L78 Accepts]: Start accepts. Automaton has 25203 states and 43625 transitions. Word has length 126 [2025-03-03 14:24:34,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:34,849 INFO L471 AbstractCegarLoop]: Abstraction has 25203 states and 43625 transitions. [2025-03-03 14:24:34,849 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:24:34,849 INFO L276 IsEmpty]: Start isEmpty. Operand 25203 states and 43625 transitions. [2025-03-03 14:24:34,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-03 14:24:34,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:34,888 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:34,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:24:34,888 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:34,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:34,888 INFO L85 PathProgramCache]: Analyzing trace with hash 648320303, now seen corresponding path program 1 times [2025-03-03 14:24:34,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:34,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2038856923] [2025-03-03 14:24:34,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:34,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:34,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-03 14:24:34,906 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-03 14:24:34,906 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:34,907 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:34,929 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:24:34,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:34,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2038856923] [2025-03-03 14:24:34,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2038856923] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:34,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:34,929 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:34,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551212573] [2025-03-03 14:24:34,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:34,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:34,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:34,930 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:34,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:34,930 INFO L87 Difference]: Start difference. First operand 25203 states and 43625 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:24:35,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:35,746 INFO L93 Difference]: Finished difference Result 60389 states and 104475 transitions. [2025-03-03 14:24:35,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:35,747 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 127 [2025-03-03 14:24:35,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:35,903 INFO L225 Difference]: With dead ends: 60389 [2025-03-03 14:24:35,903 INFO L226 Difference]: Without dead ends: 39571 [2025-03-03 14:24:35,953 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:24:35,955 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 127 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1180 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:24:35,955 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1180 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:35,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39571 states. [2025-03-03 14:24:37,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39571 to 39555. [2025-03-03 14:24:37,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39555 states, 32949 states have (on average 1.6327961394883002) internal successors, (53799), 32956 states have internal predecessors, (53799), 6550 states have call successors, (6550), 50 states have call predecessors, (6550), 55 states have return successors, (7531), 6548 states have call predecessors, (7531), 6548 states have call successors, (7531) [2025-03-03 14:24:37,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39555 states to 39555 states and 67880 transitions. [2025-03-03 14:24:37,321 INFO L78 Accepts]: Start accepts. Automaton has 39555 states and 67880 transitions. Word has length 127 [2025-03-03 14:24:37,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:37,322 INFO L471 AbstractCegarLoop]: Abstraction has 39555 states and 67880 transitions. [2025-03-03 14:24:37,322 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:24:37,322 INFO L276 IsEmpty]: Start isEmpty. Operand 39555 states and 67880 transitions. [2025-03-03 14:24:37,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 14:24:37,371 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:37,371 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:37,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:24:37,372 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:37,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:37,372 INFO L85 PathProgramCache]: Analyzing trace with hash 921385648, now seen corresponding path program 1 times [2025-03-03 14:24:37,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:37,372 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759969840] [2025-03-03 14:24:37,372 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:37,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:37,389 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 14:24:37,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 14:24:37,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:37,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:37,432 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:24:37,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:37,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759969840] [2025-03-03 14:24:37,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759969840] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:37,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:37,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:37,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814092490] [2025-03-03 14:24:37,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:37,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:37,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:37,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:37,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:37,434 INFO L87 Difference]: Start difference. First operand 39555 states and 67880 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:24:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:39,021 INFO L93 Difference]: Finished difference Result 104483 states and 180076 transitions. [2025-03-03 14:24:39,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:39,022 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 128 [2025-03-03 14:24:39,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:39,326 INFO L225 Difference]: With dead ends: 104483 [2025-03-03 14:24:39,326 INFO L226 Difference]: Without dead ends: 70651 [2025-03-03 14:24:39,421 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:24:39,421 INFO L435 NwaCegarLoop]: 605 mSDtfsCounter, 125 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1204 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:24:39,421 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1204 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:39,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70651 states. [2025-03-03 14:24:41,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70651 to 70635. [2025-03-03 14:24:41,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70635 states, 59129 states have (on average 1.630181467638553) internal successors, (96391), 59136 states have internal predecessors, (96391), 11450 states have call successors, (11450), 50 states have call predecessors, (11450), 55 states have return successors, (13245), 11448 states have call predecessors, (13245), 11448 states have call successors, (13245) [2025-03-03 14:24:42,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70635 states to 70635 states and 121086 transitions. [2025-03-03 14:24:42,121 INFO L78 Accepts]: Start accepts. Automaton has 70635 states and 121086 transitions. Word has length 128 [2025-03-03 14:24:42,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:42,122 INFO L471 AbstractCegarLoop]: Abstraction has 70635 states and 121086 transitions. [2025-03-03 14:24:42,122 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:24:42,122 INFO L276 IsEmpty]: Start isEmpty. Operand 70635 states and 121086 transitions. [2025-03-03 14:24:42,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-03 14:24:42,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:42,179 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:42,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 14:24:42,180 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:42,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:42,181 INFO L85 PathProgramCache]: Analyzing trace with hash -161648722, now seen corresponding path program 1 times [2025-03-03 14:24:42,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:42,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699995672] [2025-03-03 14:24:42,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:42,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:42,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-03 14:24:42,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-03 14:24:42,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:42,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:42,238 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:24:42,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:42,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699995672] [2025-03-03 14:24:42,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699995672] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:42,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:42,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:42,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358382784] [2025-03-03 14:24:42,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:42,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:42,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:42,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:42,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:42,240 INFO L87 Difference]: Start difference. First operand 70635 states and 121086 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:24:45,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:45,115 INFO L93 Difference]: Finished difference Result 192617 states and 330790 transitions. [2025-03-03 14:24:45,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:45,115 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 129 [2025-03-03 14:24:45,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:45,593 INFO L225 Difference]: With dead ends: 192617 [2025-03-03 14:24:45,593 INFO L226 Difference]: Without dead ends: 129599 [2025-03-03 14:24:45,748 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:24:45,751 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 123 mSDsluCounter, 599 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1206 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:24:45,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1206 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:45,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129599 states. [2025-03-03 14:24:49,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129599 to 129583. [2025-03-03 14:24:49,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129583 states, 109051 states have (on average 1.6264958597353532) internal successors, (177371), 109058 states have internal predecessors, (177371), 20476 states have call successors, (20476), 50 states have call predecessors, (20476), 55 states have return successors, (23335), 20474 states have call predecessors, (23335), 20474 states have call successors, (23335) [2025-03-03 14:24:50,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129583 states to 129583 states and 221182 transitions. [2025-03-03 14:24:50,267 INFO L78 Accepts]: Start accepts. Automaton has 129583 states and 221182 transitions. Word has length 129 [2025-03-03 14:24:50,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:50,267 INFO L471 AbstractCegarLoop]: Abstraction has 129583 states and 221182 transitions. [2025-03-03 14:24:50,267 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:24:50,268 INFO L276 IsEmpty]: Start isEmpty. Operand 129583 states and 221182 transitions. [2025-03-03 14:24:50,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-03 14:24:50,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:50,323 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:50,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 14:24:50,323 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:50,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:50,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1797368239, now seen corresponding path program 1 times [2025-03-03 14:24:50,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:50,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169171033] [2025-03-03 14:24:50,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:50,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:50,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-03 14:24:50,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-03 14:24:50,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:50,345 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:50,367 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:24:50,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:50,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169171033] [2025-03-03 14:24:50,367 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169171033] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:50,367 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:50,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:24:50,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2036283040] [2025-03-03 14:24:50,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:50,368 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:50,368 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:50,369 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:50,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:24:50,369 INFO L87 Difference]: Start difference. First operand 129583 states and 221182 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:24:55,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:55,303 INFO L93 Difference]: Finished difference Result 242913 states and 415489 transitions. [2025-03-03 14:24:55,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:55,303 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 130 [2025-03-03 14:24:55,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:56,450 INFO L225 Difference]: With dead ends: 242913 [2025-03-03 14:24:56,450 INFO L226 Difference]: Without dead ends: 242509 [2025-03-03 14:24:56,545 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:24:56,545 INFO L435 NwaCegarLoop]: 607 mSDtfsCounter, 118 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1210 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:24:56,545 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1210 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:56,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242509 states.