./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec8_product20.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec8_product20.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 14180d3cb690799ed57b4096de70e545e9154e30692708de4df58b96eb76a2f0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:57:13,170 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:57:13,230 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:57:13,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:57:13,233 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:57:13,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:57:13,255 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:57:13,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:57:13,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:57:13,256 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:57:13,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:57:13,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:57:13,256 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:57:13,256 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:57:13,256 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:57:13,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:57:13,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:57:13,256 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:57:13,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:57:13,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:57:13,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:57:13,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:57:13,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:57:13,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:57:13,257 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:57:13,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:57:13,257 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:57:13,257 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:57:13,257 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:57:13,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:57:13,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:57:13,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:57:13,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:57:13,257 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:57:13,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:57:13,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:57:13,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:57:13,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:57:13,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:57:13,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:57:13,258 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:57:13,258 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:57:13,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:57:13,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:57:13,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:57:13,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:57:13,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:57:13,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:57:13,258 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 14180d3cb690799ed57b4096de70e545e9154e30692708de4df58b96eb76a2f0 [2025-01-09 03:57:13,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:57:13,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:57:13,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:57:13,452 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:57:13,452 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:57:13,452 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec8_product20.cil.c [2025-01-09 03:57:14,597 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d54cc00d3/aed6a2251b384f40abce5a252d06c5dc/FLAGf590a5406 [2025-01-09 03:57:14,991 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:57:14,992 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product20.cil.c [2025-01-09 03:57:15,016 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d54cc00d3/aed6a2251b384f40abce5a252d06c5dc/FLAGf590a5406 [2025-01-09 03:57:15,193 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d54cc00d3/aed6a2251b384f40abce5a252d06c5dc [2025-01-09 03:57:15,195 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:57:15,196 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:57:15,197 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:57:15,198 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:57:15,201 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:57:15,202 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:57:15" (1/1) ... [2025-01-09 03:57:15,202 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6dc7dc84 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:15, skipping insertion in model container [2025-01-09 03:57:15,202 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:57:15" (1/1) ... [2025-01-09 03:57:15,248 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:57:15,433 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product20.cil.c[19452,19465] [2025-01-09 03:57:15,539 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:57:15,548 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:57:15,554 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-01-09 03:57:15,555 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [414] [2025-01-09 03:57:15,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [432] [2025-01-09 03:57:15,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [844] [2025-01-09 03:57:15,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [853] [2025-01-09 03:57:15,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EncryptAutoResponder_spec.i","") [1933] [2025-01-09 03:57:15,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1987] [2025-01-09 03:57:15,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2216] [2025-01-09 03:57:15,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2321] [2025-01-09 03:57:15,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2618] [2025-01-09 03:57:15,556 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2925] [2025-01-09 03:57:15,597 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec8_product20.cil.c[19452,19465] [2025-01-09 03:57:15,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:57:15,669 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:57:15,670 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:15 WrapperNode [2025-01-09 03:57:15,670 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:57:15,671 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:57:15,671 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:57:15,671 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:57:15,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:15" (1/1) ... [2025-01-09 03:57:15,699 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:15" (1/1) ... [2025-01-09 03:57:15,744 INFO L138 Inliner]: procedures = 129, calls = 200, calls flagged for inlining = 56, calls inlined = 49, statements flattened = 963 [2025-01-09 03:57:15,745 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:57:15,745 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:57:15,745 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:57:15,746 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:57:15,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:15" (1/1) ... [2025-01-09 03:57:15,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:15" (1/1) ... [2025-01-09 03:57:15,758 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:15" (1/1) ... [2025-01-09 03:57:15,794 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-01-09 03:57:15,794 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:15" (1/1) ... [2025-01-09 03:57:15,794 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:15" (1/1) ... [2025-01-09 03:57:15,812 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:15" (1/1) ... [2025-01-09 03:57:15,813 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:15" (1/1) ... [2025-01-09 03:57:15,825 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:15" (1/1) ... [2025-01-09 03:57:15,829 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:15" (1/1) ... [2025-01-09 03:57:15,835 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:15" (1/1) ... [2025-01-09 03:57:15,846 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:57:15,847 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:57:15,847 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:57:15,847 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:57:15,848 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:15" (1/1) ... [2025-01-09 03:57:15,856 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:57:15,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:57:15,880 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:57:15,886 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:57:15,908 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-01-09 03:57:15,908 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-01-09 03:57:15,908 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-01-09 03:57:15,908 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-01-09 03:57:15,909 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-01-09 03:57:15,909 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-01-09 03:57:15,909 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-01-09 03:57:15,909 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-01-09 03:57:15,909 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:57:15,909 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:57:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-01-09 03:57:15,910 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-01-09 03:57:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:57:15,910 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:57:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:57:15,910 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:57:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-01-09 03:57:15,910 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-01-09 03:57:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:57:15,910 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:57:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:57:15,910 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:57:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:57:15,910 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:57:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:57:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-01-09 03:57:15,910 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-01-09 03:57:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:57:15,910 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:57:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:57:15,910 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:57:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:57:15,910 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:57:15,910 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:57:15,911 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:57:15,911 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-01-09 03:57:15,911 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-01-09 03:57:15,911 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:57:15,911 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:57:15,911 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:57:15,911 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:57:15,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:57:15,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:57:15,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:57:15,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:57:15,911 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:57:15,911 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:57:15,911 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-01-09 03:57:15,911 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-01-09 03:57:15,911 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:57:15,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:57:16,093 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:57:16,095 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:57:16,909 INFO L? ?]: Removed 483 outVars from TransFormulas that were not future-live. [2025-01-09 03:57:16,909 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:57:16,922 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:57:16,923 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:57:16,923 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:57:16 BoogieIcfgContainer [2025-01-09 03:57:16,923 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:57:16,925 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:57:16,925 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:57:16,928 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:57:16,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:57:15" (1/3) ... [2025-01-09 03:57:16,928 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b436aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:57:16, skipping insertion in model container [2025-01-09 03:57:16,928 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:57:15" (2/3) ... [2025-01-09 03:57:16,929 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b436aab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:57:16, skipping insertion in model container [2025-01-09 03:57:16,929 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:57:16" (3/3) ... [2025-01-09 03:57:16,930 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec8_product20.cil.c [2025-01-09 03:57:16,939 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:57:16,942 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec8_product20.cil.c that has 23 procedures, 364 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:57:16,991 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:57:17,001 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;@183ddde5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:57:17,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:57:17,005 INFO L276 IsEmpty]: Start isEmpty. Operand has 364 states, 286 states have (on average 1.5769230769230769) internal successors, (451), 291 states have internal predecessors, (451), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 03:57:17,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 03:57:17,017 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:17,018 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:17,020 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:17,024 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:17,024 INFO L85 PathProgramCache]: Analyzing trace with hash -732462991, now seen corresponding path program 1 times [2025-01-09 03:57:17,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:17,030 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118697128] [2025-01-09 03:57:17,030 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:17,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:17,099 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:57:17,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:57:17,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:17,146 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:17,562 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 03:57:17,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:17,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118697128] [2025-01-09 03:57:17,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118697128] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:57:17,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859305225] [2025-01-09 03:57:17,563 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:17,563 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:17,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:57:17,565 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:57:17,571 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:57:17,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:57:17,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:57:17,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:17,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:17,844 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 03:57:17,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:57:17,866 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:57:17,867 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:57:17,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859305225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:17,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:57:17,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-01-09 03:57:17,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217601801] [2025-01-09 03:57:17,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:17,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:57:17,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:17,886 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:57:17,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:17,890 INFO L87 Difference]: Start difference. First operand has 364 states, 286 states have (on average 1.5769230769230769) internal successors, (451), 291 states have internal predecessors, (451), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:17,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:17,946 INFO L93 Difference]: Finished difference Result 536 states and 810 transitions. [2025-01-09 03:57:17,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:57:17,948 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2025-01-09 03:57:17,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:17,959 INFO L225 Difference]: With dead ends: 536 [2025-01-09 03:57:17,959 INFO L226 Difference]: Without dead ends: 357 [2025-01-09 03:57:17,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:17,967 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:17,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:17,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2025-01-09 03:57:18,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2025-01-09 03:57:18,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 357 states, 280 states have (on average 1.575) internal successors, (441), 284 states have internal predecessors, (441), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-01-09 03:57:18,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 548 transitions. [2025-01-09 03:57:18,032 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 548 transitions. Word has length 98 [2025-01-09 03:57:18,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:18,034 INFO L471 AbstractCegarLoop]: Abstraction has 357 states and 548 transitions. [2025-01-09 03:57:18,035 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:18,035 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 548 transitions. [2025-01-09 03:57:18,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 03:57:18,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:18,042 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:18,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:57:18,242 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 03:57:18,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:18,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:18,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1380344689, now seen corresponding path program 1 times [2025-01-09 03:57:18,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:18,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130318978] [2025-01-09 03:57:18,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:18,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:18,263 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:57:18,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:57:18,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:18,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:18,421 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 03:57:18,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:18,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130318978] [2025-01-09 03:57:18,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130318978] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:57:18,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544840150] [2025-01-09 03:57:18,422 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:18,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:18,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:57:18,424 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:57:18,426 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:57:18,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:57:18,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:57:18,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:18,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:18,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:57:18,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:57:18,679 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:57:18,681 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:57:18,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544840150] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:18,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:57:18,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:57:18,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846541310] [2025-01-09 03:57:18,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:18,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:18,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:18,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:18,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:57:18,684 INFO L87 Difference]: Start difference. First operand 357 states and 548 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:18,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:18,732 INFO L93 Difference]: Finished difference Result 525 states and 788 transitions. [2025-01-09 03:57:18,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:18,733 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 98 [2025-01-09 03:57:18,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:18,736 INFO L225 Difference]: With dead ends: 525 [2025-01-09 03:57:18,737 INFO L226 Difference]: Without dead ends: 359 [2025-01-09 03:57:18,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:57:18,738 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 1 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:18,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 1090 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:18,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2025-01-09 03:57:18,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 358. [2025-01-09 03:57:18,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 281 states have (on average 1.5729537366548043) internal successors, (442), 285 states have internal predecessors, (442), 54 states have call successors, (54), 22 states have call predecessors, (54), 22 states have return successors, (53), 52 states have call predecessors, (53), 53 states have call successors, (53) [2025-01-09 03:57:18,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 549 transitions. [2025-01-09 03:57:18,760 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 549 transitions. Word has length 98 [2025-01-09 03:57:18,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:18,760 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 549 transitions. [2025-01-09 03:57:18,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:18,761 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 549 transitions. [2025-01-09 03:57:18,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-01-09 03:57:18,763 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:18,763 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:18,771 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 03:57:18,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:18,964 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:18,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:18,965 INFO L85 PathProgramCache]: Analyzing trace with hash 482923554, now seen corresponding path program 1 times [2025-01-09 03:57:18,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:18,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436583565] [2025-01-09 03:57:18,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:18,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:18,983 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:57:18,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:57:18,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:18,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:19,139 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:57:19,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:19,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436583565] [2025-01-09 03:57:19,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436583565] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:57:19,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [837827296] [2025-01-09 03:57:19,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:19,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:19,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:57:19,144 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:57:19,147 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:57:19,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-01-09 03:57:19,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-01-09 03:57:19,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:19,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:19,380 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:57:19,383 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:57:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:57:19,397 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:57:19,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [837827296] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:19,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:57:19,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:57:19,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938348385] [2025-01-09 03:57:19,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:19,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:19,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:19,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:19,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:57:19,399 INFO L87 Difference]: Start difference. First operand 358 states and 549 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:19,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:19,423 INFO L93 Difference]: Finished difference Result 764 states and 1190 transitions. [2025-01-09 03:57:19,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:19,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 106 [2025-01-09 03:57:19,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:19,427 INFO L225 Difference]: With dead ends: 764 [2025-01-09 03:57:19,427 INFO L226 Difference]: Without dead ends: 432 [2025-01-09 03:57:19,428 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:57:19,429 INFO L435 NwaCegarLoop]: 556 mSDtfsCounter, 134 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1056 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:19,429 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1056 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:19,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-01-09 03:57:19,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 424. [2025-01-09 03:57:19,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 333 states have (on average 1.5915915915915917) internal successors, (530), 337 states have internal predecessors, (530), 68 states have call successors, (68), 22 states have call predecessors, (68), 22 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2025-01-09 03:57:19,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 665 transitions. [2025-01-09 03:57:19,476 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 665 transitions. Word has length 106 [2025-01-09 03:57:19,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:19,476 INFO L471 AbstractCegarLoop]: Abstraction has 424 states and 665 transitions. [2025-01-09 03:57:19,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:19,477 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 665 transitions. [2025-01-09 03:57:19,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:57:19,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:19,483 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:19,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:57:19,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:19,683 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:19,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:19,684 INFO L85 PathProgramCache]: Analyzing trace with hash 2069961552, now seen corresponding path program 1 times [2025-01-09 03:57:19,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:19,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325197083] [2025-01-09 03:57:19,684 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:19,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:19,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:57:19,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:57:19,736 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:19,736 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:19,839 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:57:19,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:19,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325197083] [2025-01-09 03:57:19,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325197083] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:57:19,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [860876069] [2025-01-09 03:57:19,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:19,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:19,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:57:19,842 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:57:19,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:57:19,963 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:57:20,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:57:20,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:20,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:20,056 INFO L256 TraceCheckSpWp]: Trace formula consists of 1027 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:57:20,060 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:57:20,096 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:57:20,096 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:57:20,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [860876069] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:20,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:57:20,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:57:20,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624274571] [2025-01-09 03:57:20,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:20,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:57:20,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:20,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:57:20,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:57:20,098 INFO L87 Difference]: Start difference. First operand 424 states and 665 transitions. Second operand has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:20,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:20,149 INFO L93 Difference]: Finished difference Result 839 states and 1320 transitions. [2025-01-09 03:57:20,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:57:20,150 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 107 [2025-01-09 03:57:20,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:20,153 INFO L225 Difference]: With dead ends: 839 [2025-01-09 03:57:20,153 INFO L226 Difference]: Without dead ends: 426 [2025-01-09 03:57:20,154 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:57:20,155 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 2 mSDsluCounter, 1609 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2149 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:20,155 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2149 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:20,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2025-01-09 03:57:20,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2025-01-09 03:57:20,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 334 states have (on average 1.589820359281437) internal successors, (531), 339 states have internal predecessors, (531), 68 states have call successors, (68), 22 states have call predecessors, (68), 23 states have return successors, (69), 66 states have call predecessors, (69), 67 states have call successors, (69) [2025-01-09 03:57:20,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 668 transitions. [2025-01-09 03:57:20,174 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 668 transitions. Word has length 107 [2025-01-09 03:57:20,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:20,174 INFO L471 AbstractCegarLoop]: Abstraction has 426 states and 668 transitions. [2025-01-09 03:57:20,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.5) internal successors, (74), 5 states have internal predecessors, (74), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:20,174 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 668 transitions. [2025-01-09 03:57:20,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-09 03:57:20,177 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:20,177 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:20,187 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:57:20,377 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:20,378 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:20,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:20,378 INFO L85 PathProgramCache]: Analyzing trace with hash 148684616, now seen corresponding path program 1 times [2025-01-09 03:57:20,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:20,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658695104] [2025-01-09 03:57:20,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:20,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:20,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:57:20,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:57:20,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:20,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:20,513 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 03:57:20,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:20,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658695104] [2025-01-09 03:57:20,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658695104] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:57:20,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1487593419] [2025-01-09 03:57:20,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:20,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:20,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:57:20,517 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:57:20,524 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:57:20,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-01-09 03:57:20,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-01-09 03:57:20,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:20,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:20,741 INFO L256 TraceCheckSpWp]: Trace formula consists of 1028 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:57:20,744 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:57:20,805 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:57:20,805 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:57:20,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1487593419] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:20,806 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:57:20,806 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:57:20,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21655364] [2025-01-09 03:57:20,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:20,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:57:20,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:20,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:57:20,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:57:20,807 INFO L87 Difference]: Start difference. First operand 426 states and 668 transitions. Second operand has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:20,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:20,857 INFO L93 Difference]: Finished difference Result 841 states and 1325 transitions. [2025-01-09 03:57:20,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:57:20,858 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 108 [2025-01-09 03:57:20,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:20,860 INFO L225 Difference]: With dead ends: 841 [2025-01-09 03:57:20,860 INFO L226 Difference]: Without dead ends: 428 [2025-01-09 03:57:20,862 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:57:20,862 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 2 mSDsluCounter, 1597 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2135 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:20,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2135 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:20,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-01-09 03:57:20,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2025-01-09 03:57:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 335 states have (on average 1.5880597014925373) internal successors, (532), 341 states have internal predecessors, (532), 68 states have call successors, (68), 22 states have call predecessors, (68), 24 states have return successors, (74), 66 states have call predecessors, (74), 67 states have call successors, (74) [2025-01-09 03:57:20,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 674 transitions. [2025-01-09 03:57:20,874 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 674 transitions. Word has length 108 [2025-01-09 03:57:20,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:20,874 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 674 transitions. [2025-01-09 03:57:20,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.2) internal successors, (76), 5 states have internal predecessors, (76), 3 states have call successors, (15), 2 states have call predecessors, (15), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:20,875 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 674 transitions. [2025-01-09 03:57:20,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:57:20,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:20,877 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:20,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:57:21,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:21,078 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:21,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:21,078 INFO L85 PathProgramCache]: Analyzing trace with hash 2008909058, now seen corresponding path program 1 times [2025-01-09 03:57:21,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:21,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195864013] [2025-01-09 03:57:21,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:21,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:21,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:57:21,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:57:21,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:21,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:21,180 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:57:21,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:21,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195864013] [2025-01-09 03:57:21,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195864013] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:21,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:21,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:57:21,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770489150] [2025-01-09 03:57:21,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:21,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:57:21,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:21,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:57:21,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:21,182 INFO L87 Difference]: Start difference. First operand 428 states and 674 transitions. Second operand has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:21,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:21,215 INFO L93 Difference]: Finished difference Result 833 states and 1316 transitions. [2025-01-09 03:57:21,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:57:21,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2025-01-09 03:57:21,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:21,218 INFO L225 Difference]: With dead ends: 833 [2025-01-09 03:57:21,218 INFO L226 Difference]: Without dead ends: 428 [2025-01-09 03:57:21,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:21,220 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 2 mSDsluCounter, 1612 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2153 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:21,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2153 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:21,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-01-09 03:57:21,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2025-01-09 03:57:21,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 335 states have (on average 1.5880597014925373) internal successors, (532), 341 states have internal predecessors, (532), 68 states have call successors, (68), 22 states have call predecessors, (68), 24 states have return successors, (73), 66 states have call predecessors, (73), 67 states have call successors, (73) [2025-01-09 03:57:21,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 673 transitions. [2025-01-09 03:57:21,233 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 673 transitions. Word has length 109 [2025-01-09 03:57:21,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:21,233 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 673 transitions. [2025-01-09 03:57:21,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:21,234 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 673 transitions. [2025-01-09 03:57:21,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-09 03:57:21,235 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:21,235 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:21,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:57:21,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:21,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:21,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1071874968, now seen corresponding path program 2 times [2025-01-09 03:57:21,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:21,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862125969] [2025-01-09 03:57:21,236 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:57:21,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:21,249 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 110 statements into 2 equivalence classes. [2025-01-09 03:57:21,259 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 110 of 110 statements. [2025-01-09 03:57:21,260 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:57:21,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:21,328 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:57:21,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:21,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862125969] [2025-01-09 03:57:21,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1862125969] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:21,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:21,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:57:21,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874050552] [2025-01-09 03:57:21,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:21,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:57:21,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:21,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:57:21,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:21,330 INFO L87 Difference]: Start difference. First operand 428 states and 673 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:21,368 INFO L93 Difference]: Finished difference Result 831 states and 1311 transitions. [2025-01-09 03:57:21,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:57:21,369 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 110 [2025-01-09 03:57:21,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:21,371 INFO L225 Difference]: With dead ends: 831 [2025-01-09 03:57:21,371 INFO L226 Difference]: Without dead ends: 428 [2025-01-09 03:57:21,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:21,372 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 2 mSDsluCounter, 1600 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2139 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:21,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2139 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:21,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2025-01-09 03:57:21,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2025-01-09 03:57:21,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 335 states have (on average 1.5880597014925373) internal successors, (532), 341 states have internal predecessors, (532), 68 states have call successors, (68), 22 states have call predecessors, (68), 24 states have return successors, (72), 66 states have call predecessors, (72), 67 states have call successors, (72) [2025-01-09 03:57:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 672 transitions. [2025-01-09 03:57:21,384 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 672 transitions. Word has length 110 [2025-01-09 03:57:21,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:21,384 INFO L471 AbstractCegarLoop]: Abstraction has 428 states and 672 transitions. [2025-01-09 03:57:21,385 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:21,385 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 672 transitions. [2025-01-09 03:57:21,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 03:57:21,386 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:21,386 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:21,386 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:57:21,386 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:21,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:21,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1106134736, now seen corresponding path program 3 times [2025-01-09 03:57:21,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:21,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815071235] [2025-01-09 03:57:21,387 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:57:21,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:21,400 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 111 statements into 3 equivalence classes. [2025-01-09 03:57:21,406 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 99 of 111 statements. [2025-01-09 03:57:21,406 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:57:21,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:21,495 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:57:21,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:21,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815071235] [2025-01-09 03:57:21,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815071235] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:21,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:21,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:57:21,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194045468] [2025-01-09 03:57:21,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:21,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:57:21,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:21,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:57:21,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:21,497 INFO L87 Difference]: Start difference. First operand 428 states and 672 transitions. Second operand has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:21,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:21,546 INFO L93 Difference]: Finished difference Result 833 states and 1317 transitions. [2025-01-09 03:57:21,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:57:21,547 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 111 [2025-01-09 03:57:21,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:21,549 INFO L225 Difference]: With dead ends: 833 [2025-01-09 03:57:21,549 INFO L226 Difference]: Without dead ends: 430 [2025-01-09 03:57:21,550 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:21,551 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 1 mSDsluCounter, 1608 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2150 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:21,551 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2150 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:21,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-01-09 03:57:21,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2025-01-09 03:57:21,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 336 states have (on average 1.5863095238095237) internal successors, (533), 343 states have internal predecessors, (533), 68 states have call successors, (68), 22 states have call predecessors, (68), 25 states have return successors, (77), 66 states have call predecessors, (77), 67 states have call successors, (77) [2025-01-09 03:57:21,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 678 transitions. [2025-01-09 03:57:21,563 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 678 transitions. Word has length 111 [2025-01-09 03:57:21,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:21,564 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 678 transitions. [2025-01-09 03:57:21,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.6) internal successors, (73), 5 states have internal predecessors, (73), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:21,564 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 678 transitions. [2025-01-09 03:57:21,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:57:21,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:21,566 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:21,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:57:21,566 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:21,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:21,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1136524259, now seen corresponding path program 1 times [2025-01-09 03:57:21,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:21,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961922523] [2025-01-09 03:57:21,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:21,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:21,579 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:57:21,584 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:57:21,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:21,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:21,657 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:57:21,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:21,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961922523] [2025-01-09 03:57:21,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961922523] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:21,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:21,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:57:21,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85598548] [2025-01-09 03:57:21,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:21,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:57:21,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:21,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:57:21,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:21,659 INFO L87 Difference]: Start difference. First operand 430 states and 678 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:21,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:21,696 INFO L93 Difference]: Finished difference Result 839 states and 1327 transitions. [2025-01-09 03:57:21,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:57:21,696 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 112 [2025-01-09 03:57:21,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:21,699 INFO L225 Difference]: With dead ends: 839 [2025-01-09 03:57:21,699 INFO L226 Difference]: Without dead ends: 432 [2025-01-09 03:57:21,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:57:21,700 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 1 mSDsluCounter, 1614 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2156 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:21,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2156 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:21,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-01-09 03:57:21,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2025-01-09 03:57:21,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 337 states have (on average 1.5845697329376855) internal successors, (534), 345 states have internal predecessors, (534), 68 states have call successors, (68), 22 states have call predecessors, (68), 26 states have return successors, (79), 66 states have call predecessors, (79), 67 states have call successors, (79) [2025-01-09 03:57:21,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 681 transitions. [2025-01-09 03:57:21,719 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 681 transitions. Word has length 112 [2025-01-09 03:57:21,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:21,719 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 681 transitions. [2025-01-09 03:57:21,720 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-01-09 03:57:21,720 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 681 transitions. [2025-01-09 03:57:21,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:57:21,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:21,722 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:21,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:57:21,722 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:21,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:21,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1035988556, now seen corresponding path program 1 times [2025-01-09 03:57:21,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:21,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708409676] [2025-01-09 03:57:21,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:21,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:21,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:57:21,745 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:57:21,745 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:21,745 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:21,857 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:57:21,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:21,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708409676] [2025-01-09 03:57:21,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708409676] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:57:21,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [302641507] [2025-01-09 03:57:21,857 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:21,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:57:21,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:57:21,864 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:57:21,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:57:22,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:57:22,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:57:22,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:22,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:22,109 INFO L256 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:57:22,111 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:57:22,145 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:22,147 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:57:22,246 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:22,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [302641507] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:57:22,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:57:22,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-01-09 03:57:22,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115626200] [2025-01-09 03:57:22,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:57:22,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:57:22,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:22,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:57:22,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:57:22,250 INFO L87 Difference]: Start difference. First operand 432 states and 681 transitions. Second operand has 11 states, 10 states have (on average 11.9) internal successors, (119), 11 states have internal predecessors, (119), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-01-09 03:57:23,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:23,193 INFO L93 Difference]: Finished difference Result 1274 states and 2092 transitions. [2025-01-09 03:57:23,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:57:23,193 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.9) internal successors, (119), 11 states have internal predecessors, (119), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) Word has length 113 [2025-01-09 03:57:23,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:23,200 INFO L225 Difference]: With dead ends: 1274 [2025-01-09 03:57:23,200 INFO L226 Difference]: Without dead ends: 870 [2025-01-09 03:57:23,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-01-09 03:57:23,202 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 1348 mSDsluCounter, 3332 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1348 SdHoareTripleChecker+Valid, 3869 SdHoareTripleChecker+Invalid, 651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:23,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1348 Valid, 3869 Invalid, 651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 03:57:23,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-01-09 03:57:23,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 846. [2025-01-09 03:57:23,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 846 states, 672 states have (on average 1.630952380952381) internal successors, (1096), 679 states have internal predecessors, (1096), 147 states have call successors, (147), 23 states have call predecessors, (147), 26 states have return successors, (168), 145 states have call predecessors, (168), 146 states have call successors, (168) [2025-01-09 03:57:23,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1411 transitions. [2025-01-09 03:57:23,241 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1411 transitions. Word has length 113 [2025-01-09 03:57:23,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:23,242 INFO L471 AbstractCegarLoop]: Abstraction has 846 states and 1411 transitions. [2025-01-09 03:57:23,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.9) internal successors, (119), 11 states have internal predecessors, (119), 4 states have call successors, (25), 2 states have call predecessors, (25), 3 states have return successors, (22), 3 states have call predecessors, (22), 4 states have call successors, (22) [2025-01-09 03:57:23,242 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1411 transitions. [2025-01-09 03:57:23,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 03:57:23,246 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:23,247 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:23,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 03:57:23,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-09 03:57:23,447 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:23,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:23,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1740719981, now seen corresponding path program 1 times [2025-01-09 03:57:23,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:23,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250065142] [2025-01-09 03:57:23,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:23,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:23,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 03:57:23,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 03:57:23,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:23,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:23,489 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:23,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:23,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250065142] [2025-01-09 03:57:23,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250065142] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:23,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:23,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:23,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765808588] [2025-01-09 03:57:23,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:23,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:23,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:23,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:23,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:23,491 INFO L87 Difference]: Start difference. First operand 846 states and 1411 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:23,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:23,528 INFO L93 Difference]: Finished difference Result 2005 states and 3398 transitions. [2025-01-09 03:57:23,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:23,529 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2025-01-09 03:57:23,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:23,534 INFO L225 Difference]: With dead ends: 2005 [2025-01-09 03:57:23,534 INFO L226 Difference]: Without dead ends: 1237 [2025-01-09 03:57:23,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:23,537 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 131 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1089 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:23,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1089 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:23,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2025-01-09 03:57:23,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 1229. [2025-01-09 03:57:23,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1229 states, 976 states have (on average 1.6485655737704918) internal successors, (1609), 983 states have internal predecessors, (1609), 226 states have call successors, (226), 23 states have call predecessors, (226), 26 states have return successors, (257), 224 states have call predecessors, (257), 225 states have call successors, (257) [2025-01-09 03:57:23,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1229 states to 1229 states and 2092 transitions. [2025-01-09 03:57:23,610 INFO L78 Accepts]: Start accepts. Automaton has 1229 states and 2092 transitions. Word has length 117 [2025-01-09 03:57:23,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:23,610 INFO L471 AbstractCegarLoop]: Abstraction has 1229 states and 2092 transitions. [2025-01-09 03:57:23,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:23,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1229 states and 2092 transitions. [2025-01-09 03:57:23,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 03:57:23,615 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:23,615 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:23,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:57:23,615 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:23,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:23,616 INFO L85 PathProgramCache]: Analyzing trace with hash -98261686, now seen corresponding path program 1 times [2025-01-09 03:57:23,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:23,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848343702] [2025-01-09 03:57:23,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:23,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:23,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:57:23,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:57:23,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:23,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:23,661 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:23,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:23,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848343702] [2025-01-09 03:57:23,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [848343702] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:23,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:23,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:23,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978131564] [2025-01-09 03:57:23,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:23,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:23,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:23,662 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:23,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:23,663 INFO L87 Difference]: Start difference. First operand 1229 states and 2092 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:23,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:23,731 INFO L93 Difference]: Finished difference Result 2962 states and 5074 transitions. [2025-01-09 03:57:23,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:23,732 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-01-09 03:57:23,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:23,745 INFO L225 Difference]: With dead ends: 2962 [2025-01-09 03:57:23,745 INFO L226 Difference]: Without dead ends: 1862 [2025-01-09 03:57:23,751 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:23,752 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 129 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:23,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1090 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:23,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2025-01-09 03:57:23,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1854. [2025-01-09 03:57:23,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1854 states, 1482 states have (on average 1.656545209176788) internal successors, (2455), 1489 states have internal predecessors, (2455), 345 states have call successors, (345), 23 states have call predecessors, (345), 26 states have return successors, (376), 343 states have call predecessors, (376), 344 states have call successors, (376) [2025-01-09 03:57:23,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1854 states to 1854 states and 3176 transitions. [2025-01-09 03:57:23,849 INFO L78 Accepts]: Start accepts. Automaton has 1854 states and 3176 transitions. Word has length 118 [2025-01-09 03:57:23,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:23,849 INFO L471 AbstractCegarLoop]: Abstraction has 1854 states and 3176 transitions. [2025-01-09 03:57:23,849 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:23,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1854 states and 3176 transitions. [2025-01-09 03:57:23,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 03:57:23,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:23,857 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:23,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:57:23,857 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:23,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:23,858 INFO L85 PathProgramCache]: Analyzing trace with hash -270139931, now seen corresponding path program 1 times [2025-01-09 03:57:23,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:23,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417694817] [2025-01-09 03:57:23,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:23,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:23,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:57:23,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:57:23,877 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:23,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:23,902 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:23,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:23,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417694817] [2025-01-09 03:57:23,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417694817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:23,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:23,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:23,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549229613] [2025-01-09 03:57:23,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:23,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:23,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:23,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:23,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:23,903 INFO L87 Difference]: Start difference. First operand 1854 states and 3176 transitions. Second operand has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:23,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:23,979 INFO L93 Difference]: Finished difference Result 4414 states and 7623 transitions. [2025-01-09 03:57:23,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:23,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-01-09 03:57:23,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:23,994 INFO L225 Difference]: With dead ends: 4414 [2025-01-09 03:57:23,994 INFO L226 Difference]: Without dead ends: 2820 [2025-01-09 03:57:24,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:24,000 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 127 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:24,000 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1083 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:24,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2820 states. [2025-01-09 03:57:24,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2820 to 2812. [2025-01-09 03:57:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2812 states, 2278 states have (on average 1.6633011413520633) internal successors, (3789), 2285 states have internal predecessors, (3789), 507 states have call successors, (507), 23 states have call predecessors, (507), 26 states have return successors, (554), 505 states have call predecessors, (554), 506 states have call successors, (554) [2025-01-09 03:57:24,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2812 states to 2812 states and 4850 transitions. [2025-01-09 03:57:24,130 INFO L78 Accepts]: Start accepts. Automaton has 2812 states and 4850 transitions. Word has length 119 [2025-01-09 03:57:24,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:24,131 INFO L471 AbstractCegarLoop]: Abstraction has 2812 states and 4850 transitions. [2025-01-09 03:57:24,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.333333333333332) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:24,131 INFO L276 IsEmpty]: Start isEmpty. Operand 2812 states and 4850 transitions. [2025-01-09 03:57:24,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-01-09 03:57:24,140 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:24,140 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:24,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:57:24,140 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:24,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:24,141 INFO L85 PathProgramCache]: Analyzing trace with hash 212611625, now seen corresponding path program 1 times [2025-01-09 03:57:24,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:24,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008035513] [2025-01-09 03:57:24,141 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:24,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:24,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-01-09 03:57:24,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-01-09 03:57:24,158 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:24,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:24,181 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:24,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:24,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008035513] [2025-01-09 03:57:24,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008035513] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:24,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:24,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:24,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014464160] [2025-01-09 03:57:24,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:24,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:24,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:24,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:24,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:24,182 INFO L87 Difference]: Start difference. First operand 2812 states and 4850 transitions. Second operand has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:24,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:24,297 INFO L93 Difference]: Finished difference Result 6707 states and 11655 transitions. [2025-01-09 03:57:24,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:24,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-01-09 03:57:24,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:24,319 INFO L225 Difference]: With dead ends: 6707 [2025-01-09 03:57:24,319 INFO L226 Difference]: Without dead ends: 4367 [2025-01-09 03:57:24,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:24,327 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 125 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1083 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:24,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1083 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:24,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4367 states. [2025-01-09 03:57:24,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4367 to 4359. [2025-01-09 03:57:24,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4359 states, 3580 states have (on average 1.6681564245810057) internal successors, (5972), 3587 states have internal predecessors, (5972), 752 states have call successors, (752), 23 states have call predecessors, (752), 26 states have return successors, (825), 750 states have call predecessors, (825), 751 states have call successors, (825) [2025-01-09 03:57:24,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4359 states to 4359 states and 7549 transitions. [2025-01-09 03:57:24,542 INFO L78 Accepts]: Start accepts. Automaton has 4359 states and 7549 transitions. Word has length 120 [2025-01-09 03:57:24,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:24,543 INFO L471 AbstractCegarLoop]: Abstraction has 4359 states and 7549 transitions. [2025-01-09 03:57:24,543 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 26.666666666666668) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:24,543 INFO L276 IsEmpty]: Start isEmpty. Operand 4359 states and 7549 transitions. [2025-01-09 03:57:24,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 03:57:24,554 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:24,554 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:24,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:57:24,555 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:24,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:24,555 INFO L85 PathProgramCache]: Analyzing trace with hash -1193677367, now seen corresponding path program 1 times [2025-01-09 03:57:24,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:24,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238904545] [2025-01-09 03:57:24,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:24,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:24,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 03:57:24,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 03:57:24,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:24,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:24,599 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:24,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:24,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238904545] [2025-01-09 03:57:24,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238904545] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:24,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:24,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:24,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730062584] [2025-01-09 03:57:24,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:24,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:24,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:24,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:24,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:24,600 INFO L87 Difference]: Start difference. First operand 4359 states and 7549 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:24,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:24,769 INFO L93 Difference]: Finished difference Result 10801 states and 18807 transitions. [2025-01-09 03:57:24,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:24,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-01-09 03:57:24,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:24,807 INFO L225 Difference]: With dead ends: 10801 [2025-01-09 03:57:24,808 INFO L226 Difference]: Without dead ends: 7155 [2025-01-09 03:57:24,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:24,822 INFO L435 NwaCegarLoop]: 557 mSDtfsCounter, 123 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:24,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1101 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:24,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7155 states. [2025-01-09 03:57:25,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7155 to 7147. [2025-01-09 03:57:25,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7147 states, 5875 states have (on average 1.664) internal successors, (9776), 5882 states have internal predecessors, (9776), 1245 states have call successors, (1245), 23 states have call predecessors, (1245), 26 states have return successors, (1362), 1243 states have call predecessors, (1362), 1244 states have call successors, (1362) [2025-01-09 03:57:25,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7147 states to 7147 states and 12383 transitions. [2025-01-09 03:57:25,180 INFO L78 Accepts]: Start accepts. Automaton has 7147 states and 12383 transitions. Word has length 121 [2025-01-09 03:57:25,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:25,180 INFO L471 AbstractCegarLoop]: Abstraction has 7147 states and 12383 transitions. [2025-01-09 03:57:25,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:25,180 INFO L276 IsEmpty]: Start isEmpty. Operand 7147 states and 12383 transitions. [2025-01-09 03:57:25,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 03:57:25,199 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:25,199 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:25,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:57:25,199 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:25,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:25,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1258700219, now seen corresponding path program 1 times [2025-01-09 03:57:25,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:25,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774378879] [2025-01-09 03:57:25,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:25,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:25,213 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 03:57:25,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 03:57:25,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:25,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:25,294 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:25,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:25,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774378879] [2025-01-09 03:57:25,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774378879] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:25,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:25,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:25,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236451815] [2025-01-09 03:57:25,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:25,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:25,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:25,295 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:25,295 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:25,296 INFO L87 Difference]: Start difference. First operand 7147 states and 12383 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:25,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:25,646 INFO L93 Difference]: Finished difference Result 18088 states and 31527 transitions. [2025-01-09 03:57:25,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:25,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2025-01-09 03:57:25,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:25,723 INFO L225 Difference]: With dead ends: 18088 [2025-01-09 03:57:25,723 INFO L226 Difference]: Without dead ends: 12040 [2025-01-09 03:57:25,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-01-09 03:57:25,758 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 121 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1088 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:25,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1088 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:25,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12040 states. [2025-01-09 03:57:26,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12040 to 12032. [2025-01-09 03:57:26,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12032 states, 9938 states have (on average 1.6636144093378948) internal successors, (16533), 9945 states have internal predecessors, (16533), 2067 states have call successors, (2067), 23 states have call predecessors, (2067), 26 states have return successors, (2262), 2065 states have call predecessors, (2262), 2066 states have call successors, (2262) [2025-01-09 03:57:26,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12032 states to 12032 states and 20862 transitions. [2025-01-09 03:57:26,281 INFO L78 Accepts]: Start accepts. Automaton has 12032 states and 20862 transitions. Word has length 122 [2025-01-09 03:57:26,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:26,281 INFO L471 AbstractCegarLoop]: Abstraction has 12032 states and 20862 transitions. [2025-01-09 03:57:26,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:26,281 INFO L276 IsEmpty]: Start isEmpty. Operand 12032 states and 20862 transitions. [2025-01-09 03:57:26,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 03:57:26,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:26,303 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:26,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:57:26,303 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:26,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:26,304 INFO L85 PathProgramCache]: Analyzing trace with hash 142256807, now seen corresponding path program 1 times [2025-01-09 03:57:26,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:26,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549007955] [2025-01-09 03:57:26,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:26,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:26,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 03:57:26,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:57:26,323 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:26,323 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:26,352 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:26,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:26,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549007955] [2025-01-09 03:57:26,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549007955] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:26,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:26,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:26,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071521740] [2025-01-09 03:57:26,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:26,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:26,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:26,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:26,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:26,354 INFO L87 Difference]: Start difference. First operand 12032 states and 20862 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:26,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:26,772 INFO L93 Difference]: Finished difference Result 28808 states and 49868 transitions. [2025-01-09 03:57:26,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:26,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 123 [2025-01-09 03:57:26,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:26,845 INFO L225 Difference]: With dead ends: 28808 [2025-01-09 03:57:26,845 INFO L226 Difference]: Without dead ends: 18827 [2025-01-09 03:57:26,881 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:26,882 INFO L435 NwaCegarLoop]: 553 mSDtfsCounter, 119 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1066 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:26,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1066 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:26,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18827 states. [2025-01-09 03:57:27,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18827 to 18819. [2025-01-09 03:57:27,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18819 states, 15522 states have (on average 1.6387707769617317) internal successors, (25437), 15529 states have internal predecessors, (25437), 3270 states have call successors, (3270), 23 states have call predecessors, (3270), 26 states have return successors, (3609), 3268 states have call predecessors, (3609), 3269 states have call successors, (3609) [2025-01-09 03:57:27,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18819 states to 18819 states and 32316 transitions. [2025-01-09 03:57:27,718 INFO L78 Accepts]: Start accepts. Automaton has 18819 states and 32316 transitions. Word has length 123 [2025-01-09 03:57:27,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:27,719 INFO L471 AbstractCegarLoop]: Abstraction has 18819 states and 32316 transitions. [2025-01-09 03:57:27,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:27,719 INFO L276 IsEmpty]: Start isEmpty. Operand 18819 states and 32316 transitions. [2025-01-09 03:57:27,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 03:57:27,746 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:27,746 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:27,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:57:27,747 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:27,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:27,747 INFO L85 PathProgramCache]: Analyzing trace with hash 896655236, now seen corresponding path program 1 times [2025-01-09 03:57:27,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:27,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112123322] [2025-01-09 03:57:27,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:27,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:27,764 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 03:57:27,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 03:57:27,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:27,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:27,808 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:27,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:27,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112123322] [2025-01-09 03:57:27,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112123322] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:27,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:27,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:27,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108719743] [2025-01-09 03:57:27,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:27,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:27,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:27,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:27,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:27,810 INFO L87 Difference]: Start difference. First operand 18819 states and 32316 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:28,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:28,823 INFO L93 Difference]: Finished difference Result 49800 states and 85806 transitions. [2025-01-09 03:57:28,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:28,824 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2025-01-09 03:57:28,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:28,935 INFO L225 Difference]: With dead ends: 49800 [2025-01-09 03:57:28,935 INFO L226 Difference]: Without dead ends: 33645 [2025-01-09 03:57:28,973 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:28,973 INFO L435 NwaCegarLoop]: 546 mSDtfsCounter, 117 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1086 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:28,973 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1086 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:29,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33645 states. [2025-01-09 03:57:29,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33645 to 33637. [2025-01-09 03:57:30,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33637 states, 27890 states have (on average 1.634994621728218) internal successors, (45600), 27897 states have internal predecessors, (45600), 5720 states have call successors, (5720), 23 states have call predecessors, (5720), 26 states have return successors, (6333), 5718 states have call predecessors, (6333), 5719 states have call successors, (6333) [2025-01-09 03:57:30,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33637 states to 33637 states and 57653 transitions. [2025-01-09 03:57:30,160 INFO L78 Accepts]: Start accepts. Automaton has 33637 states and 57653 transitions. Word has length 124 [2025-01-09 03:57:30,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:30,161 INFO L471 AbstractCegarLoop]: Abstraction has 33637 states and 57653 transitions. [2025-01-09 03:57:30,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:30,161 INFO L276 IsEmpty]: Start isEmpty. Operand 33637 states and 57653 transitions. [2025-01-09 03:57:30,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 03:57:30,186 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:30,187 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:30,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:57:30,187 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:30,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:30,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1240516973, now seen corresponding path program 1 times [2025-01-09 03:57:30,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:30,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283647263] [2025-01-09 03:57:30,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:30,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:30,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:57:30,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:57:30,206 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:30,206 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:30,237 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:30,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:30,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283647263] [2025-01-09 03:57:30,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283647263] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:30,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:30,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:30,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802741474] [2025-01-09 03:57:30,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:30,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:30,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:30,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:30,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:30,240 INFO L87 Difference]: Start difference. First operand 33637 states and 57653 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:31,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:31,889 INFO L93 Difference]: Finished difference Result 91837 states and 157838 transitions. [2025-01-09 03:57:31,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:31,890 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2025-01-09 03:57:31,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:32,240 INFO L225 Difference]: With dead ends: 91837 [2025-01-09 03:57:32,240 INFO L226 Difference]: Without dead ends: 61743 [2025-01-09 03:57:32,366 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:32,367 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 115 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:32,367 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1090 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:32,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61743 states. [2025-01-09 03:57:34,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61743 to 61735. [2025-01-09 03:57:34,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61735 states, 51475 states have (on average 1.6302282661486158) internal successors, (83916), 51482 states have internal predecessors, (83916), 10233 states have call successors, (10233), 23 states have call predecessors, (10233), 26 states have return successors, (11378), 10231 states have call predecessors, (11378), 10232 states have call successors, (11378) [2025-01-09 03:57:34,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61735 states to 61735 states and 105527 transitions. [2025-01-09 03:57:34,901 INFO L78 Accepts]: Start accepts. Automaton has 61735 states and 105527 transitions. Word has length 125 [2025-01-09 03:57:34,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:34,902 INFO L471 AbstractCegarLoop]: Abstraction has 61735 states and 105527 transitions. [2025-01-09 03:57:34,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:34,902 INFO L276 IsEmpty]: Start isEmpty. Operand 61735 states and 105527 transitions. [2025-01-09 03:57:34,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 03:57:34,933 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:34,934 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:34,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:57:34,934 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:34,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:34,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1241205316, now seen corresponding path program 1 times [2025-01-09 03:57:34,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:34,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65643703] [2025-01-09 03:57:34,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:34,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:35,342 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 03:57:35,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 03:57:35,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:35,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:35,413 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:35,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:35,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65643703] [2025-01-09 03:57:35,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65643703] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:35,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:35,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:57:35,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960507449] [2025-01-09 03:57:35,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:35,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:57:35,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:35,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:57:35,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:35,420 INFO L87 Difference]: Start difference. First operand 61735 states and 105527 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:37,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:37,579 INFO L93 Difference]: Finished difference Result 115694 states and 198127 transitions. [2025-01-09 03:57:37,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:57:37,579 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 126 [2025-01-09 03:57:37,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:38,052 INFO L225 Difference]: With dead ends: 115694 [2025-01-09 03:57:38,052 INFO L226 Difference]: Without dead ends: 115528 [2025-01-09 03:57:38,128 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:57:38,131 INFO L435 NwaCegarLoop]: 555 mSDtfsCounter, 110 mSDsluCounter, 545 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1100 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:38,131 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1100 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:57:38,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115528 states. [2025-01-09 03:57:41,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115528 to 115520. [2025-01-09 03:57:42,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115520 states, 96892 states have (on average 1.6244478388308632) internal successors, (157396), 96899 states have internal predecessors, (157396), 18601 states have call successors, (18601), 23 states have call predecessors, (18601), 26 states have return successors, (20792), 18599 states have call predecessors, (20792), 18600 states have call successors, (20792) [2025-01-09 03:57:42,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115520 states to 115520 states and 196789 transitions. [2025-01-09 03:57:42,605 INFO L78 Accepts]: Start accepts. Automaton has 115520 states and 196789 transitions. Word has length 126 [2025-01-09 03:57:42,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:42,606 INFO L471 AbstractCegarLoop]: Abstraction has 115520 states and 196789 transitions. [2025-01-09 03:57:42,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-01-09 03:57:42,606 INFO L276 IsEmpty]: Start isEmpty. Operand 115520 states and 196789 transitions. [2025-01-09 03:57:42,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 03:57:42,635 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:42,636 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:42,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:57:42,636 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:42,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:42,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1964805038, now seen corresponding path program 1 times [2025-01-09 03:57:42,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:42,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648173732] [2025-01-09 03:57:42,637 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:42,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:42,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:57:42,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:57:42,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:42,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:42,901 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:42,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:42,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648173732] [2025-01-09 03:57:42,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648173732] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:42,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:42,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 03:57:42,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190508212] [2025-01-09 03:57:42,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:42,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 03:57:42,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:42,903 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 03:57:42,903 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:57:42,903 INFO L87 Difference]: Start difference. First operand 115520 states and 196789 transitions. Second operand has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 03:57:48,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:57:48,620 INFO L93 Difference]: Finished difference Result 230156 states and 397549 transitions. [2025-01-09 03:57:48,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 03:57:48,620 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) Word has length 127 [2025-01-09 03:57:48,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:57:49,967 INFO L225 Difference]: With dead ends: 230156 [2025-01-09 03:57:49,968 INFO L226 Difference]: Without dead ends: 229996 [2025-01-09 03:57:50,278 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=525, Unknown=0, NotChecked=0, Total=650 [2025-01-09 03:57:50,279 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 1422 mSDsluCounter, 5499 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1422 SdHoareTripleChecker+Valid, 6141 SdHoareTripleChecker+Invalid, 1405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:57:50,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1422 Valid, 6141 Invalid, 1405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 03:57:50,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229996 states. [2025-01-09 03:57:56,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229996 to 229959. [2025-01-09 03:57:57,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229959 states, 192947 states have (on average 1.6250628410910768) internal successors, (313551), 192852 states have internal predecessors, (313551), 36948 states have call successors, (36948), 57 states have call predecessors, (36948), 63 states have return successors, (44609), 37055 states have call predecessors, (44609), 36945 states have call successors, (44609) [2025-01-09 03:57:57,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229959 states to 229959 states and 395108 transitions. [2025-01-09 03:57:57,945 INFO L78 Accepts]: Start accepts. Automaton has 229959 states and 395108 transitions. Word has length 127 [2025-01-09 03:57:57,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:57:57,945 INFO L471 AbstractCegarLoop]: Abstraction has 229959 states and 395108 transitions. [2025-01-09 03:57:57,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.909090909090909) internal successors, (87), 10 states have internal predecessors, (87), 5 states have call successors, (15), 3 states have call predecessors, (15), 3 states have return successors, (12), 6 states have call predecessors, (12), 5 states have call successors, (12) [2025-01-09 03:57:57,946 INFO L276 IsEmpty]: Start isEmpty. Operand 229959 states and 395108 transitions. [2025-01-09 03:57:57,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 03:57:57,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:57:57,995 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:57:57,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:57:57,995 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoing__wrappee__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:57:57,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:57:57,996 INFO L85 PathProgramCache]: Analyzing trace with hash -1944405283, now seen corresponding path program 1 times [2025-01-09 03:57:57,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:57:57,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451867032] [2025-01-09 03:57:57,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:57:57,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:57:58,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 03:57:58,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 03:57:58,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:57:58,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:57:58,064 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:57:58,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:57:58,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451867032] [2025-01-09 03:57:58,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451867032] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:57:58,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:57:58,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 03:57:58,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316126561] [2025-01-09 03:57:58,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:57:58,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:57:58,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:57:58,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:57:58,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 03:57:58,066 INFO L87 Difference]: Start difference. First operand 229959 states and 395108 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12)