./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec27_productSimulator.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec27_productSimulator.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fe4506e3d5e012e1662dc0aa7741c8e3f8f99dc7c5ccf1f202c2f95071bfbf64 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:32:41,501 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:32:41,555 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:32:41,559 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:32:41,564 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:32:41,586 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:32:41,588 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:32:41,588 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:32:41,588 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:32:41,588 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:32:41,589 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:32:41,589 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:32:41,589 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:32:41,589 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:32:41,589 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:32:41,590 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:32:41,590 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:32:41,590 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:32:41,590 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:32:41,590 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:32:41,590 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:32:41,590 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:32:41,590 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:32:41,590 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:32:41,590 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:32:41,590 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:32:41,590 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:32:41,590 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:32:41,590 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:32:41,590 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:32:41,591 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:32:41,591 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:32:41,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:32:41,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:32:41,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:32:41,591 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:32:41,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:32:41,591 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:32:41,591 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:32:41,591 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:32:41,591 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:32:41,591 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:32:41,591 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:32:41,591 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> fe4506e3d5e012e1662dc0aa7741c8e3f8f99dc7c5ccf1f202c2f95071bfbf64 [2025-03-08 05:32:41,823 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:32:41,828 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:32:41,830 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:32:41,831 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:32:41,831 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:32:41,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec27_productSimulator.cil.c [2025-03-08 05:32:42,962 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63be163ab/129e97d5cba5449aa535959d82dcdc46/FLAG35d7e1a7a [2025-03-08 05:32:43,268 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:32:43,268 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_productSimulator.cil.c [2025-03-08 05:32:43,286 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63be163ab/129e97d5cba5449aa535959d82dcdc46/FLAG35d7e1a7a [2025-03-08 05:32:43,297 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/63be163ab/129e97d5cba5449aa535959d82dcdc46 [2025-03-08 05:32:43,300 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:32:43,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:32:43,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:32:43,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:32:43,305 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:32:43,306 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:32:43" (1/1) ... [2025-03-08 05:32:43,306 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c178e11 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:43, skipping insertion in model container [2025-03-08 05:32:43,306 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:32:43" (1/1) ... [2025-03-08 05:32:43,342 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:32:43,535 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_productSimulator.cil.c[11237,11250] [2025-03-08 05:32:43,708 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:32:43,718 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:32:43,727 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [48] [2025-03-08 05:32:43,728 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [414] [2025-03-08 05:32:43,728 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [423] [2025-03-08 05:32:43,728 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [441] [2025-03-08 05:32:43,729 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [561] [2025-03-08 05:32:43,729 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1641] [2025-03-08 05:32:43,729 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"VerifyForward_spec.i","") [1918] [2025-03-08 05:32:43,729 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1952] [2025-03-08 05:32:43,729 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2362] [2025-03-08 05:32:43,729 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [2922] [2025-03-08 05:32:43,729 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [3271] [2025-03-08 05:32:43,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec27_productSimulator.cil.c[11237,11250] [2025-03-08 05:32:43,797 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:32:43,824 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:32:43,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:43 WrapperNode [2025-03-08 05:32:43,824 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:32:43,825 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:32:43,825 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:32:43,825 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:32:43,833 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:43" (1/1) ... [2025-03-08 05:32:43,851 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:43" (1/1) ... [2025-03-08 05:32:43,889 INFO L138 Inliner]: procedures = 151, calls = 264, calls flagged for inlining = 66, calls inlined = 63, statements flattened = 1306 [2025-03-08 05:32:43,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:32:43,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:32:43,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:32:43,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:32:43,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:43" (1/1) ... [2025-03-08 05:32:43,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:43" (1/1) ... [2025-03-08 05:32:43,902 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:43" (1/1) ... [2025-03-08 05:32:43,936 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-08 05:32:43,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:43" (1/1) ... [2025-03-08 05:32:43,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:43" (1/1) ... [2025-03-08 05:32:43,963 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:43" (1/1) ... [2025-03-08 05:32:43,966 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:43" (1/1) ... [2025-03-08 05:32:43,974 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:43" (1/1) ... [2025-03-08 05:32:43,977 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:43" (1/1) ... [2025-03-08 05:32:43,987 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:32:43,988 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:32:43,988 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:32:43,988 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:32:43,989 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:43" (1/1) ... [2025-03-08 05:32:43,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:32:44,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:44,018 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:32:44,022 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:32:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-08 05:32:44,040 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-08 05:32:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure setup_chuck__before__Keys [2025-03-08 05:32:44,040 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_chuck__before__Keys [2025-03-08 05:32:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Sign [2025-03-08 05:32:44,040 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Sign [2025-03-08 05:32:44,040 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-08 05:32:44,041 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-08 05:32:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:32:44,041 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:32:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-08 05:32:44,041 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-08 05:32:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:32:44,041 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:32:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Verify [2025-03-08 05:32:44,041 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Verify [2025-03-08 05:32:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:32:44,041 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:32:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure setup_bob__before__Keys [2025-03-08 05:32:44,041 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_bob__before__Keys [2025-03-08 05:32:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:32:44,041 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:32:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:32:44,041 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:32:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:32:44,041 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:32:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Decrypt [2025-03-08 05:32:44,041 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Decrypt [2025-03-08 05:32:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__Encrypt [2025-03-08 05:32:44,041 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__Encrypt [2025-03-08 05:32:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:32:44,041 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:32:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:32:44,041 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:32:44,041 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:32:44,042 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:32:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Forward [2025-03-08 05:32:44,042 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Forward [2025-03-08 05:32:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:32:44,042 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:32:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-08 05:32:44,042 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-08 05:32:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:32:44,042 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:32:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable__before__Encrypt [2025-03-08 05:32:44,042 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable__before__Encrypt [2025-03-08 05:32:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:32:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:32:44,042 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:32:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-08 05:32:44,042 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-08 05:32:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__before__AddressBook [2025-03-08 05:32:44,042 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__before__AddressBook [2025-03-08 05:32:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Encrypt [2025-03-08 05:32:44,042 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Encrypt [2025-03-08 05:32:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__AutoResponder [2025-03-08 05:32:44,042 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__AutoResponder [2025-03-08 05:32:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-08 05:32:44,042 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-08 05:32:44,042 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:32:44,042 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:32:44,044 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:32:44,045 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:32:44,045 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:32:44,045 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:32:44,045 INFO L130 BoogieDeclarations]: Found specification of procedure isVerified [2025-03-08 05:32:44,045 INFO L138 BoogieDeclarations]: Found implementation of procedure isVerified [2025-03-08 05:32:44,045 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-08 05:32:44,045 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-08 05:32:44,046 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:32:44,046 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:32:44,046 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:32:44,046 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:32:44,046 INFO L130 BoogieDeclarations]: Found specification of procedure setup_rjh__before__Keys [2025-03-08 05:32:44,046 INFO L138 BoogieDeclarations]: Found implementation of procedure setup_rjh__before__Keys [2025-03-08 05:32:44,046 INFO L130 BoogieDeclarations]: Found specification of procedure incoming__before__Verify [2025-03-08 05:32:44,046 INFO L138 BoogieDeclarations]: Found implementation of procedure incoming__before__Verify [2025-03-08 05:32:44,046 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:32:44,046 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:32:44,046 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:32:44,047 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:32:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:32:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:32:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:32:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:32:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:32:44,047 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:32:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure printMail__before__Sign [2025-03-08 05:32:44,047 INFO L138 BoogieDeclarations]: Found implementation of procedure printMail__before__Sign [2025-03-08 05:32:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2025-03-08 05:32:44,047 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2025-03-08 05:32:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-08 05:32:44,047 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-08 05:32:44,047 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:32:44,047 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:32:44,248 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:32:44,252 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:32:44,282 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3410: #res := ~retValue_acc~40; [2025-03-08 05:32:44,296 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2269: #res := ~retValue_acc~31; [2025-03-08 05:32:44,312 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2806: #res := ~retValue_acc~38; [2025-03-08 05:32:44,327 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1183: #res := ~retValue_acc~15; [2025-03-08 05:32:44,409 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L727: #res := ~retValue_acc~9; [2025-03-08 05:32:44,446 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2006-1: getEmailId_#res#1 := getEmailId_~retValue_acc~24#1; [2025-03-08 05:32:44,479 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2232: #res := ~retValue_acc~30; [2025-03-08 05:32:44,528 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2080: #res := ~retValue_acc~26; [2025-03-08 05:32:44,583 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3448: #res#1 := ~retValue_acc~42#1; [2025-03-08 05:32:44,583 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3430-1: isReadable__role__Encrypt_#res#1 := isReadable__role__Encrypt_~retValue_acc~41#1; [2025-03-08 05:32:44,665 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2343: #res := ~retValue_acc~33; [2025-03-08 05:32:44,684 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1275: #res#1 := ~retValue_acc~17#1; [2025-03-08 05:32:44,684 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1230-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~16#1; [2025-03-08 05:32:44,737 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1499: #res := ~retValue_acc~20; [2025-03-08 05:32:44,752 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L3472-1: createEmail_#res#1 := createEmail_~retValue_acc~44#1; [2025-03-08 05:32:44,761 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2195: #res := ~retValue_acc~29; [2025-03-08 05:32:44,793 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1618-1: getClientId_#res#1 := getClientId_~retValue_acc~22#1; [2025-03-08 05:32:44,827 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1571-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~21#1; [2025-03-08 05:32:44,834 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2306: #res := ~retValue_acc~32; [2025-03-08 05:32:44,859 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L463: #res := ~retValue_acc~4; [2025-03-08 05:32:44,876 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1053: #res := ~retValue_acc~13; [2025-03-08 05:32:44,894 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1136-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~14#1; [2025-03-08 05:32:45,145 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2763-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~35#1; [2025-03-08 05:32:45,146 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2781-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~37#1; [2025-03-08 05:32:45,146 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1445-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~19#1; [2025-03-08 05:32:45,146 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L558-1: valid_product_#res#1 := valid_product_~retValue_acc~5#1; [2025-03-08 05:32:45,146 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2772-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~36#1; [2025-03-08 05:32:45,146 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1338-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~18#1; [2025-03-08 05:32:45,158 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2043: #res := ~retValue_acc~25; [2025-03-08 05:32:45,346 INFO L? ?]: Removed 625 outVars from TransFormulas that were not future-live. [2025-03-08 05:32:45,346 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:32:45,366 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:32:45,366 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:32:45,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:32:45 BoogieIcfgContainer [2025-03-08 05:32:45,367 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:32:45,368 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:32:45,368 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:32:45,372 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:32:45,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:32:43" (1/3) ... [2025-03-08 05:32:45,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23dd9b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:32:45, skipping insertion in model container [2025-03-08 05:32:45,372 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:32:43" (2/3) ... [2025-03-08 05:32:45,373 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23dd9b98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:32:45, skipping insertion in model container [2025-03-08 05:32:45,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:32:45" (3/3) ... [2025-03-08 05:32:45,374 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec27_productSimulator.cil.c [2025-03-08 05:32:45,384 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:32:45,388 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec27_productSimulator.cil.c that has 45 procedures, 606 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:32:45,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:32:45,448 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;@173c5e88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:32:45,449 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:32:45,454 INFO L276 IsEmpty]: Start isEmpty. Operand has 606 states, 448 states have (on average 1.5133928571428572) internal successors, (678), 468 states have internal predecessors, (678), 112 states have call successors, (112), 44 states have call predecessors, (112), 44 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-03-08 05:32:45,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 05:32:45,474 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:45,478 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:45,479 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:45,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:45,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1962612848, now seen corresponding path program 1 times [2025-03-08 05:32:45,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:45,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046632795] [2025-03-08 05:32:45,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:45,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:45,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 05:32:45,631 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 05:32:45,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:45,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:45,807 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 05:32:45,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:45,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046632795] [2025-03-08 05:32:45,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046632795] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:45,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:45,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 05:32:45,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78841395] [2025-03-08 05:32:45,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:45,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 05:32:45,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:45,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 05:32:45,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:32:45,836 INFO L87 Difference]: Start difference. First operand has 606 states, 448 states have (on average 1.5133928571428572) internal successors, (678), 468 states have internal predecessors, (678), 112 states have call successors, (112), 44 states have call predecessors, (112), 44 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) Second operand has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:32:45,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:45,901 INFO L93 Difference]: Finished difference Result 945 states and 1394 transitions. [2025-03-08 05:32:45,902 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 05:32:45,903 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 158 [2025-03-08 05:32:45,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:45,915 INFO L225 Difference]: With dead ends: 945 [2025-03-08 05:32:45,915 INFO L226 Difference]: Without dead ends: 599 [2025-03-08 05:32:45,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 05:32:45,923 INFO L435 NwaCegarLoop]: 899 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, 899 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:45,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 899 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:45,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-08 05:32:45,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2025-03-08 05:32:45,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 442 states have (on average 1.51131221719457) internal successors, (668), 461 states have internal predecessors, (668), 112 states have call successors, (112), 44 states have call predecessors, (112), 44 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-08 05:32:45,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 891 transitions. [2025-03-08 05:32:45,993 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 891 transitions. Word has length 158 [2025-03-08 05:32:45,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:45,994 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 891 transitions. [2025-03-08 05:32:45,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 42.0) internal successors, (84), 2 states have internal predecessors, (84), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:32:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 891 transitions. [2025-03-08 05:32:46,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 05:32:46,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:46,002 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:46,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 05:32:46,003 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:46,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:46,004 INFO L85 PathProgramCache]: Analyzing trace with hash 228508398, now seen corresponding path program 1 times [2025-03-08 05:32:46,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:46,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978273330] [2025-03-08 05:32:46,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:46,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:46,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 05:32:46,066 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 05:32:46,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:46,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:46,333 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 05:32:46,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:46,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978273330] [2025-03-08 05:32:46,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978273330] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:46,334 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:46,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:32:46,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186571535] [2025-03-08 05:32:46,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:46,335 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:32:46,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:46,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:32:46,335 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:46,336 INFO L87 Difference]: Start difference. First operand 599 states and 891 transitions. Second operand has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:32:46,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:46,438 INFO L93 Difference]: Finished difference Result 1162 states and 1726 transitions. [2025-03-08 05:32:46,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:32:46,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 158 [2025-03-08 05:32:46,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:46,466 INFO L225 Difference]: With dead ends: 1162 [2025-03-08 05:32:46,467 INFO L226 Difference]: Without dead ends: 599 [2025-03-08 05:32:46,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:32:46,470 INFO L435 NwaCegarLoop]: 889 mSDtfsCounter, 0 mSDsluCounter, 2655 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 3544 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:46,470 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 3544 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:46,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-08 05:32:46,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2025-03-08 05:32:46,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 442 states have (on average 1.495475113122172) internal successors, (661), 461 states have internal predecessors, (661), 112 states have call successors, (112), 44 states have call predecessors, (112), 44 states have return successors, (111), 110 states have call predecessors, (111), 111 states have call successors, (111) [2025-03-08 05:32:46,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 884 transitions. [2025-03-08 05:32:46,512 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 884 transitions. Word has length 158 [2025-03-08 05:32:46,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:46,513 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 884 transitions. [2025-03-08 05:32:46,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.8) internal successors, (84), 5 states have internal predecessors, (84), 2 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2025-03-08 05:32:46,514 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 884 transitions. [2025-03-08 05:32:46,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 05:32:46,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:46,522 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:46,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 05:32:46,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:46,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:46,522 INFO L85 PathProgramCache]: Analyzing trace with hash -582538385, now seen corresponding path program 1 times [2025-03-08 05:32:46,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:46,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104027146] [2025-03-08 05:32:46,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:46,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:46,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 05:32:46,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 05:32:46,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:46,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:46,675 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 05:32:46,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:46,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104027146] [2025-03-08 05:32:46,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104027146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:46,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:46,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:46,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479602946] [2025-03-08 05:32:46,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:46,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:46,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:46,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:46,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:46,678 INFO L87 Difference]: Start difference. First operand 599 states and 884 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-08 05:32:46,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:46,740 INFO L93 Difference]: Finished difference Result 1166 states and 1734 transitions. [2025-03-08 05:32:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:46,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) Word has length 163 [2025-03-08 05:32:46,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:46,747 INFO L225 Difference]: With dead ends: 1166 [2025-03-08 05:32:46,747 INFO L226 Difference]: Without dead ends: 600 [2025-03-08 05:32:46,749 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:46,752 INFO L435 NwaCegarLoop]: 875 mSDtfsCounter, 846 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 846 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:46,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [846 Valid, 899 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:46,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2025-03-08 05:32:46,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2025-03-08 05:32:46,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 444 states have (on average 1.4864864864864864) internal successors, (660), 461 states have internal predecessors, (660), 110 states have call successors, (110), 45 states have call predecessors, (110), 45 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-03-08 05:32:46,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 879 transitions. [2025-03-08 05:32:46,787 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 879 transitions. Word has length 163 [2025-03-08 05:32:46,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:46,787 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 879 transitions. [2025-03-08 05:32:46,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 3 states have call successors, (30), 2 states have call predecessors, (30), 1 states have return successors, (21), 3 states have call predecessors, (21), 3 states have call successors, (21) [2025-03-08 05:32:46,788 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 879 transitions. [2025-03-08 05:32:46,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-08 05:32:46,791 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:46,791 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:46,791 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 05:32:46,791 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:46,792 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:46,792 INFO L85 PathProgramCache]: Analyzing trace with hash 18764256, now seen corresponding path program 1 times [2025-03-08 05:32:46,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:46,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699523568] [2025-03-08 05:32:46,792 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:46,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:46,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-08 05:32:46,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-08 05:32:46,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:46,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:46,908 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 05:32:46,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:46,909 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699523568] [2025-03-08 05:32:46,909 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699523568] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:46,909 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:46,909 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:46,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512718984] [2025-03-08 05:32:46,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:46,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:46,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:46,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:46,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:46,911 INFO L87 Difference]: Start difference. First operand 600 states and 879 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:32:47,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:47,005 INFO L93 Difference]: Finished difference Result 1712 states and 2544 transitions. [2025-03-08 05:32:47,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:47,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 184 [2025-03-08 05:32:47,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:47,014 INFO L225 Difference]: With dead ends: 1712 [2025-03-08 05:32:47,014 INFO L226 Difference]: Without dead ends: 1146 [2025-03-08 05:32:47,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:47,019 INFO L435 NwaCegarLoop]: 896 mSDtfsCounter, 833 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:47,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1739 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:47,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1146 states. [2025-03-08 05:32:47,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1146 to 1144. [2025-03-08 05:32:47,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1144 states, 849 states have (on average 1.4935217903415783) internal successors, (1268), 879 states have internal predecessors, (1268), 205 states have call successors, (205), 89 states have call predecessors, (205), 89 states have return successors, (216), 202 states have call predecessors, (216), 203 states have call successors, (216) [2025-03-08 05:32:47,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1144 states to 1144 states and 1689 transitions. [2025-03-08 05:32:47,077 INFO L78 Accepts]: Start accepts. Automaton has 1144 states and 1689 transitions. Word has length 184 [2025-03-08 05:32:47,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:47,078 INFO L471 AbstractCegarLoop]: Abstraction has 1144 states and 1689 transitions. [2025-03-08 05:32:47,078 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:32:47,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1144 states and 1689 transitions. [2025-03-08 05:32:47,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2025-03-08 05:32:47,085 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:47,085 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:47,085 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 05:32:47,085 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:47,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:47,086 INFO L85 PathProgramCache]: Analyzing trace with hash -502213332, now seen corresponding path program 1 times [2025-03-08 05:32:47,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:47,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698180563] [2025-03-08 05:32:47,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:47,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:47,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 185 statements into 1 equivalence classes. [2025-03-08 05:32:47,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 185 of 185 statements. [2025-03-08 05:32:47,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:47,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:47,216 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-03-08 05:32:47,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:47,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698180563] [2025-03-08 05:32:47,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698180563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:47,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:47,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:47,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240618066] [2025-03-08 05:32:47,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:47,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:47,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:47,218 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:47,218 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:47,218 INFO L87 Difference]: Start difference. First operand 1144 states and 1689 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:32:47,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:47,272 INFO L93 Difference]: Finished difference Result 1146 states and 1690 transitions. [2025-03-08 05:32:47,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:47,272 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 185 [2025-03-08 05:32:47,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:47,276 INFO L225 Difference]: With dead ends: 1146 [2025-03-08 05:32:47,277 INFO L226 Difference]: Without dead ends: 601 [2025-03-08 05:32:47,279 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:47,280 INFO L435 NwaCegarLoop]: 865 mSDtfsCounter, 826 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:47,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 902 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:47,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 601 states. [2025-03-08 05:32:47,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 601 to 601. [2025-03-08 05:32:47,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 601 states, 446 states have (on average 1.4753363228699552) internal successors, (658), 461 states have internal predecessors, (658), 108 states have call successors, (108), 46 states have call predecessors, (108), 46 states have return successors, (107), 106 states have call predecessors, (107), 107 states have call successors, (107) [2025-03-08 05:32:47,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 873 transitions. [2025-03-08 05:32:47,312 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 873 transitions. Word has length 185 [2025-03-08 05:32:47,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:47,312 INFO L471 AbstractCegarLoop]: Abstraction has 601 states and 873 transitions. [2025-03-08 05:32:47,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 3 states have internal predecessors, (105), 2 states have call successors, (33), 2 states have call predecessors, (33), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-03-08 05:32:47,313 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 873 transitions. [2025-03-08 05:32:47,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-03-08 05:32:47,316 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:47,316 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:47,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:32:47,316 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:47,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:47,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1821202339, now seen corresponding path program 1 times [2025-03-08 05:32:47,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:47,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653864490] [2025-03-08 05:32:47,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:47,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:47,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-03-08 05:32:47,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-03-08 05:32:47,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:47,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:47,429 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-03-08 05:32:47,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:47,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653864490] [2025-03-08 05:32:47,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653864490] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:47,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:47,431 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:47,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033675086] [2025-03-08 05:32:47,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:47,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:47,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:47,432 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:47,432 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:47,432 INFO L87 Difference]: Start difference. First operand 601 states and 873 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 05:32:47,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:47,498 INFO L93 Difference]: Finished difference Result 1156 states and 1686 transitions. [2025-03-08 05:32:47,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:47,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 194 [2025-03-08 05:32:47,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:47,503 INFO L225 Difference]: With dead ends: 1156 [2025-03-08 05:32:47,503 INFO L226 Difference]: Without dead ends: 604 [2025-03-08 05:32:47,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:47,505 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 808 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:47,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 887 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:47,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-03-08 05:32:47,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 598. [2025-03-08 05:32:47,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 446 states have (on average 1.4506726457399104) internal successors, (647), 456 states have internal predecessors, (647), 105 states have call successors, (105), 46 states have call predecessors, (105), 46 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 05:32:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 856 transitions. [2025-03-08 05:32:47,537 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 856 transitions. Word has length 194 [2025-03-08 05:32:47,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:47,537 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 856 transitions. [2025-03-08 05:32:47,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 2 states have call successors, (34), 2 states have call predecessors, (34), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2025-03-08 05:32:47,538 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 856 transitions. [2025-03-08 05:32:47,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-08 05:32:47,541 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:47,541 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:47,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:32:47,541 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:47,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:47,542 INFO L85 PathProgramCache]: Analyzing trace with hash -2071027466, now seen corresponding path program 1 times [2025-03-08 05:32:47,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:47,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411563995] [2025-03-08 05:32:47,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:47,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:47,585 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 05:32:47,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 05:32:47,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:47,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:47,878 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-03-08 05:32:47,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:47,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411563995] [2025-03-08 05:32:47,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411563995] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:47,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1466185893] [2025-03-08 05:32:47,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:47,879 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:47,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:47,881 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:32:47,883 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:32:48,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 05:32:48,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 05:32:48,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:48,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:48,257 INFO L256 TraceCheckSpWp]: Trace formula consists of 1610 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:32:48,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:48,310 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-08 05:32:48,310 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:48,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1466185893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:48,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:48,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-08 05:32:48,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945549154] [2025-03-08 05:32:48,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:48,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:48,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:48,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:48,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:32:48,312 INFO L87 Difference]: Start difference. First operand 598 states and 856 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 05:32:48,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:48,355 INFO L93 Difference]: Finished difference Result 928 states and 1311 transitions. [2025-03-08 05:32:48,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:48,356 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 212 [2025-03-08 05:32:48,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:48,359 INFO L225 Difference]: With dead ends: 928 [2025-03-08 05:32:48,360 INFO L226 Difference]: Without dead ends: 599 [2025-03-08 05:32:48,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:32:48,361 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 0 mSDsluCounter, 849 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1700 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:48,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1700 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:48,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-03-08 05:32:48,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 599. [2025-03-08 05:32:48,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 599 states, 447 states have (on average 1.4496644295302012) internal successors, (648), 457 states have internal predecessors, (648), 105 states have call successors, (105), 46 states have call predecessors, (105), 46 states have return successors, (104), 103 states have call predecessors, (104), 104 states have call successors, (104) [2025-03-08 05:32:48,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 599 states to 599 states and 857 transitions. [2025-03-08 05:32:48,391 INFO L78 Accepts]: Start accepts. Automaton has 599 states and 857 transitions. Word has length 212 [2025-03-08 05:32:48,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:48,392 INFO L471 AbstractCegarLoop]: Abstraction has 599 states and 857 transitions. [2025-03-08 05:32:48,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 05:32:48,392 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 857 transitions. [2025-03-08 05:32:48,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-08 05:32:48,395 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:48,395 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:48,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 05:32:48,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:48,596 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:48,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:48,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1102580937, now seen corresponding path program 1 times [2025-03-08 05:32:48,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:48,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144926474] [2025-03-08 05:32:48,597 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:48,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:48,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-08 05:32:48,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 05:32:48,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:48,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:48,937 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-08 05:32:48,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:48,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144926474] [2025-03-08 05:32:48,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144926474] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:48,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1745292984] [2025-03-08 05:32:48,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:48,938 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:48,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:48,940 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:32:48,942 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:32:49,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-08 05:32:49,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 05:32:49,341 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:49,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:49,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 1630 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:32:49,360 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:49,388 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-08 05:32:49,391 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:49,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1745292984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:49,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:49,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-08 05:32:49,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592294342] [2025-03-08 05:32:49,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:49,393 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:49,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:49,393 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:49,394 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:32:49,394 INFO L87 Difference]: Start difference. First operand 599 states and 857 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 05:32:49,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:49,451 INFO L93 Difference]: Finished difference Result 1214 states and 1772 transitions. [2025-03-08 05:32:49,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:49,452 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 218 [2025-03-08 05:32:49,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:49,456 INFO L225 Difference]: With dead ends: 1214 [2025-03-08 05:32:49,456 INFO L226 Difference]: Without dead ends: 695 [2025-03-08 05:32:49,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 218 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:32:49,458 INFO L435 NwaCegarLoop]: 861 mSDtfsCounter, 165 mSDsluCounter, 803 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 1664 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:49,459 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 1664 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:49,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2025-03-08 05:32:49,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 687. [2025-03-08 05:32:49,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 521 states have (on average 1.4664107485604607) internal successors, (764), 531 states have internal predecessors, (764), 119 states have call successors, (119), 46 states have call predecessors, (119), 46 states have return successors, (118), 117 states have call predecessors, (118), 118 states have call successors, (118) [2025-03-08 05:32:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 1001 transitions. [2025-03-08 05:32:49,489 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 1001 transitions. Word has length 218 [2025-03-08 05:32:49,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:49,490 INFO L471 AbstractCegarLoop]: Abstraction has 687 states and 1001 transitions. [2025-03-08 05:32:49,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 2 states have call successors, (37), 2 states have call predecessors, (37), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 05:32:49,490 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 1001 transitions. [2025-03-08 05:32:49,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-08 05:32:49,494 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:49,494 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:49,503 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:32:49,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-03-08 05:32:49,696 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:49,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:49,697 INFO L85 PathProgramCache]: Analyzing trace with hash -382751882, now seen corresponding path program 1 times [2025-03-08 05:32:49,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:49,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106912341] [2025-03-08 05:32:49,697 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:49,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:49,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-08 05:32:49,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-08 05:32:49,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:49,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:49,995 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-03-08 05:32:49,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:49,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106912341] [2025-03-08 05:32:49,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106912341] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:49,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [721731760] [2025-03-08 05:32:49,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:49,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:49,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:50,000 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:32:50,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:32:50,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-08 05:32:50,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-08 05:32:50,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:50,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:50,350 INFO L256 TraceCheckSpWp]: Trace formula consists of 1635 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:32:50,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:50,507 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2025-03-08 05:32:50,507 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:50,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [721731760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:50,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:50,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-08 05:32:50,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619972807] [2025-03-08 05:32:50,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:50,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:50,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:50,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:50,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:32:50,509 INFO L87 Difference]: Start difference. First operand 687 states and 1001 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-08 05:32:50,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:50,596 INFO L93 Difference]: Finished difference Result 1646 states and 2397 transitions. [2025-03-08 05:32:50,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:50,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 219 [2025-03-08 05:32:50,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:50,608 INFO L225 Difference]: With dead ends: 1646 [2025-03-08 05:32:50,608 INFO L226 Difference]: Without dead ends: 1325 [2025-03-08 05:32:50,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:32:50,614 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 721 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 1687 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:50,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [721 Valid, 1687 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:50,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1325 states. [2025-03-08 05:32:50,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1325 to 1323. [2025-03-08 05:32:50,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1323 states, 1011 states have (on average 1.4747774480712166) internal successors, (1491), 1028 states have internal predecessors, (1491), 222 states have call successors, (222), 89 states have call predecessors, (222), 89 states have return successors, (229), 218 states have call predecessors, (229), 220 states have call successors, (229) [2025-03-08 05:32:50,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1323 states to 1323 states and 1942 transitions. [2025-03-08 05:32:50,687 INFO L78 Accepts]: Start accepts. Automaton has 1323 states and 1942 transitions. Word has length 219 [2025-03-08 05:32:50,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:50,687 INFO L471 AbstractCegarLoop]: Abstraction has 1323 states and 1942 transitions. [2025-03-08 05:32:50,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 3 states have call successors, (37), 3 states have call predecessors, (37), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2025-03-08 05:32:50,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1323 states and 1942 transitions. [2025-03-08 05:32:50,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2025-03-08 05:32:50,693 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:50,693 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:50,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 05:32:50,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:50,894 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:50,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:50,895 INFO L85 PathProgramCache]: Analyzing trace with hash 1469663508, now seen corresponding path program 1 times [2025-03-08 05:32:50,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:50,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043423433] [2025-03-08 05:32:50,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:50,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:50,919 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 05:32:50,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 05:32:50,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:50,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:51,132 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-08 05:32:51,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:51,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043423433] [2025-03-08 05:32:51,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043423433] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:51,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528907019] [2025-03-08 05:32:51,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:51,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:51,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:51,136 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:32:51,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:32:51,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 212 statements into 1 equivalence classes. [2025-03-08 05:32:51,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 212 of 212 statements. [2025-03-08 05:32:51,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:51,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:51,477 INFO L256 TraceCheckSpWp]: Trace formula consists of 1598 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 05:32:51,484 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:51,561 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-08 05:32:51,562 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:51,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528907019] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:51,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:51,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-03-08 05:32:51,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257678832] [2025-03-08 05:32:51,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:51,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:32:51,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:51,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:32:51,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-03-08 05:32:51,563 INFO L87 Difference]: Start difference. First operand 1323 states and 1942 transitions. Second operand has 8 states, 6 states have (on average 21.5) internal successors, (129), 8 states have internal predecessors, (129), 4 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-08 05:32:51,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:51,711 INFO L93 Difference]: Finished difference Result 2567 states and 3794 transitions. [2025-03-08 05:32:51,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:32:51,712 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 21.5) internal successors, (129), 8 states have internal predecessors, (129), 4 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) Word has length 212 [2025-03-08 05:32:51,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:51,719 INFO L225 Difference]: With dead ends: 2567 [2025-03-08 05:32:51,720 INFO L226 Difference]: Without dead ends: 1327 [2025-03-08 05:32:51,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-03-08 05:32:51,724 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 4 mSDsluCounter, 5029 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5870 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:51,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5870 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:32:51,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1327 states. [2025-03-08 05:32:51,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1327 to 1327. [2025-03-08 05:32:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1327 states, 1013 states have (on average 1.4738400789733466) internal successors, (1493), 1032 states have internal predecessors, (1493), 222 states have call successors, (222), 89 states have call predecessors, (222), 91 states have return successors, (233), 218 states have call predecessors, (233), 220 states have call successors, (233) [2025-03-08 05:32:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1327 states to 1327 states and 1948 transitions. [2025-03-08 05:32:51,781 INFO L78 Accepts]: Start accepts. Automaton has 1327 states and 1948 transitions. Word has length 212 [2025-03-08 05:32:51,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:51,781 INFO L471 AbstractCegarLoop]: Abstraction has 1327 states and 1948 transitions. [2025-03-08 05:32:51,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 21.5) internal successors, (129), 8 states have internal predecessors, (129), 4 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-08 05:32:51,782 INFO L276 IsEmpty]: Start isEmpty. Operand 1327 states and 1948 transitions. [2025-03-08 05:32:51,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-08 05:32:51,787 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:51,787 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:51,798 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:32:51,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:51,991 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:51,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:51,992 INFO L85 PathProgramCache]: Analyzing trace with hash -665195120, now seen corresponding path program 1 times [2025-03-08 05:32:51,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:51,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915214734] [2025-03-08 05:32:51,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:51,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:52,013 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-08 05:32:52,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-08 05:32:52,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:52,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:52,195 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 05:32:52,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:52,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915214734] [2025-03-08 05:32:52,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915214734] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:52,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591500787] [2025-03-08 05:32:52,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:52,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:52,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:52,198 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:32:52,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:32:52,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-08 05:32:52,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-08 05:32:52,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:52,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:52,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 1606 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:32:52,571 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:52,667 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-08 05:32:52,667 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:52,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591500787] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:52,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:52,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2025-03-08 05:32:52,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828785256] [2025-03-08 05:32:52,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:52,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:52,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:52,670 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:52,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:32:52,670 INFO L87 Difference]: Start difference. First operand 1327 states and 1948 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-08 05:32:52,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:52,755 INFO L93 Difference]: Finished difference Result 3674 states and 5531 transitions. [2025-03-08 05:32:52,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:52,755 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 213 [2025-03-08 05:32:52,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:52,769 INFO L225 Difference]: With dead ends: 3674 [2025-03-08 05:32:52,769 INFO L226 Difference]: Without dead ends: 2478 [2025-03-08 05:32:52,774 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:32:52,774 INFO L435 NwaCegarLoop]: 1146 mSDtfsCounter, 689 mSDsluCounter, 831 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1977 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:52,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1977 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:52,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2478 states. [2025-03-08 05:32:52,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2478 to 2476. [2025-03-08 05:32:52,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2476 states, 1897 states have (on average 1.4870848708487086) internal successors, (2821), 1929 states have internal predecessors, (2821), 408 states have call successors, (408), 168 states have call predecessors, (408), 170 states have return successors, (461), 400 states have call predecessors, (461), 404 states have call successors, (461) [2025-03-08 05:32:52,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2476 states to 2476 states and 3690 transitions. [2025-03-08 05:32:52,903 INFO L78 Accepts]: Start accepts. Automaton has 2476 states and 3690 transitions. Word has length 213 [2025-03-08 05:32:52,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:52,905 INFO L471 AbstractCegarLoop]: Abstraction has 2476 states and 3690 transitions. [2025-03-08 05:32:52,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 3 states have call successors, (36), 3 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-08 05:32:52,905 INFO L276 IsEmpty]: Start isEmpty. Operand 2476 states and 3690 transitions. [2025-03-08 05:32:52,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-03-08 05:32:52,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:52,913 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:52,923 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 05:32:53,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 05:32:53,114 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:53,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:53,115 INFO L85 PathProgramCache]: Analyzing trace with hash -658660016, now seen corresponding path program 1 times [2025-03-08 05:32:53,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:53,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867555256] [2025-03-08 05:32:53,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:53,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:53,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-08 05:32:53,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-08 05:32:53,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:53,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:53,311 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 05:32:53,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:53,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867555256] [2025-03-08 05:32:53,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867555256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:53,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [723997363] [2025-03-08 05:32:53,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:53,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:53,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:53,317 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:32:53,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:32:53,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-03-08 05:32:53,615 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-03-08 05:32:53,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:53,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:53,622 INFO L256 TraceCheckSpWp]: Trace formula consists of 1599 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:32:53,626 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:53,679 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2025-03-08 05:32:53,679 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:32:53,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [723997363] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:53,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:32:53,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 13 [2025-03-08 05:32:53,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063049087] [2025-03-08 05:32:53,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:53,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:32:53,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:53,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:32:53,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:32:53,681 INFO L87 Difference]: Start difference. First operand 2476 states and 3690 transitions. Second operand has 6 states, 5 states have (on average 26.2) internal successors, (131), 6 states have internal predecessors, (131), 3 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-08 05:32:53,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:53,811 INFO L93 Difference]: Finished difference Result 4868 states and 7292 transitions. [2025-03-08 05:32:53,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:32:53,812 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 26.2) internal successors, (131), 6 states have internal predecessors, (131), 3 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 213 [2025-03-08 05:32:53,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:53,826 INFO L225 Difference]: With dead ends: 4868 [2025-03-08 05:32:53,826 INFO L226 Difference]: Without dead ends: 2484 [2025-03-08 05:32:53,833 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2025-03-08 05:32:53,835 INFO L435 NwaCegarLoop]: 841 mSDtfsCounter, 2 mSDsluCounter, 3347 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 4188 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:53,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 4188 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:53,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2025-03-08 05:32:53,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 2480. [2025-03-08 05:32:53,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2480 states, 1899 states have (on average 1.4865718799368088) internal successors, (2823), 1933 states have internal predecessors, (2823), 408 states have call successors, (408), 168 states have call predecessors, (408), 172 states have return successors, (471), 400 states have call predecessors, (471), 404 states have call successors, (471) [2025-03-08 05:32:53,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2480 states and 3702 transitions. [2025-03-08 05:32:53,933 INFO L78 Accepts]: Start accepts. Automaton has 2480 states and 3702 transitions. Word has length 213 [2025-03-08 05:32:53,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:53,933 INFO L471 AbstractCegarLoop]: Abstraction has 2480 states and 3702 transitions. [2025-03-08 05:32:53,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 26.2) internal successors, (131), 6 states have internal predecessors, (131), 3 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-08 05:32:53,933 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3702 transitions. [2025-03-08 05:32:53,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-03-08 05:32:53,940 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:53,941 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:53,951 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 05:32:54,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:54,141 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:54,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:54,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1700314159, now seen corresponding path program 1 times [2025-03-08 05:32:54,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:54,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505062937] [2025-03-08 05:32:54,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:54,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:54,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-03-08 05:32:54,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-03-08 05:32:54,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:54,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 113 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-08 05:32:54,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:54,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505062937] [2025-03-08 05:32:54,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505062937] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:54,394 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:54,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:32:54,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697430066] [2025-03-08 05:32:54,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:54,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:32:54,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:54,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:32:54,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:32:54,396 INFO L87 Difference]: Start difference. First operand 2480 states and 3702 transitions. Second operand has 8 states, 6 states have (on average 21.166666666666668) internal successors, (127), 8 states have internal predecessors, (127), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-08 05:32:54,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:54,545 INFO L93 Difference]: Finished difference Result 4840 states and 7258 transitions. [2025-03-08 05:32:54,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:32:54,549 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 21.166666666666668) internal successors, (127), 8 states have internal predecessors, (127), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) Word has length 214 [2025-03-08 05:32:54,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:54,561 INFO L225 Difference]: With dead ends: 4840 [2025-03-08 05:32:54,562 INFO L226 Difference]: Without dead ends: 2480 [2025-03-08 05:32:54,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:32:54,570 INFO L435 NwaCegarLoop]: 842 mSDtfsCounter, 4 mSDsluCounter, 5035 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 5877 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:54,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 5877 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:54,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2480 states. [2025-03-08 05:32:54,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2480 to 2480. [2025-03-08 05:32:54,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2480 states, 1899 states have (on average 1.4865718799368088) internal successors, (2823), 1933 states have internal predecessors, (2823), 408 states have call successors, (408), 168 states have call predecessors, (408), 172 states have return successors, (469), 400 states have call predecessors, (469), 404 states have call successors, (469) [2025-03-08 05:32:54,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2480 states to 2480 states and 3700 transitions. [2025-03-08 05:32:54,706 INFO L78 Accepts]: Start accepts. Automaton has 2480 states and 3700 transitions. Word has length 214 [2025-03-08 05:32:54,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:54,707 INFO L471 AbstractCegarLoop]: Abstraction has 2480 states and 3700 transitions. [2025-03-08 05:32:54,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 21.166666666666668) internal successors, (127), 8 states have internal predecessors, (127), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-08 05:32:54,707 INFO L276 IsEmpty]: Start isEmpty. Operand 2480 states and 3700 transitions. [2025-03-08 05:32:54,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2025-03-08 05:32:54,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:54,716 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:54,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:32:54,716 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:54,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:54,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1985104571, now seen corresponding path program 2 times [2025-03-08 05:32:54,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:54,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425869617] [2025-03-08 05:32:54,717 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:32:54,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:54,740 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 215 statements into 2 equivalence classes. [2025-03-08 05:32:54,752 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 104 of 215 statements. [2025-03-08 05:32:54,752 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:32:54,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:54,879 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:32:54,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:54,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425869617] [2025-03-08 05:32:54,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425869617] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:54,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:54,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-08 05:32:54,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646377615] [2025-03-08 05:32:54,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:54,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-08 05:32:54,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:54,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-08 05:32:54,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:32:54,881 INFO L87 Difference]: Start difference. First operand 2480 states and 3700 transitions. Second operand has 10 states, 10 states have (on average 12.4) internal successors, (124), 8 states have internal predecessors, (124), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 4 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 05:32:54,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:54,985 INFO L93 Difference]: Finished difference Result 3714 states and 5511 transitions. [2025-03-08 05:32:54,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:32:54,985 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 8 states have internal predecessors, (124), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 4 states have call predecessors, (27), 2 states have call successors, (27) Word has length 215 [2025-03-08 05:32:54,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:55,002 INFO L225 Difference]: With dead ends: 3714 [2025-03-08 05:32:55,002 INFO L226 Difference]: Without dead ends: 2496 [2025-03-08 05:32:55,007 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:32:55,007 INFO L435 NwaCegarLoop]: 846 mSDtfsCounter, 0 mSDsluCounter, 6755 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7601 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:55,008 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7601 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:55,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2496 states. [2025-03-08 05:32:55,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2496 to 2496. [2025-03-08 05:32:55,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2496 states, 1911 states have (on average 1.4835164835164836) internal successors, (2835), 1945 states have internal predecessors, (2835), 408 states have call successors, (408), 168 states have call predecessors, (408), 176 states have return successors, (477), 404 states have call predecessors, (477), 404 states have call successors, (477) [2025-03-08 05:32:55,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2496 states to 2496 states and 3720 transitions. [2025-03-08 05:32:55,128 INFO L78 Accepts]: Start accepts. Automaton has 2496 states and 3720 transitions. Word has length 215 [2025-03-08 05:32:55,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:55,129 INFO L471 AbstractCegarLoop]: Abstraction has 2496 states and 3720 transitions. [2025-03-08 05:32:55,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 12.4) internal successors, (124), 8 states have internal predecessors, (124), 2 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 4 states have call predecessors, (27), 2 states have call successors, (27) [2025-03-08 05:32:55,129 INFO L276 IsEmpty]: Start isEmpty. Operand 2496 states and 3720 transitions. [2025-03-08 05:32:55,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2025-03-08 05:32:55,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:55,136 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:55,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:32:55,136 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:55,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:55,137 INFO L85 PathProgramCache]: Analyzing trace with hash 2063392300, now seen corresponding path program 1 times [2025-03-08 05:32:55,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:55,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911703158] [2025-03-08 05:32:55,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:55,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:55,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 218 statements into 1 equivalence classes. [2025-03-08 05:32:55,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 218 of 218 statements. [2025-03-08 05:32:55,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:55,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:55,324 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2025-03-08 05:32:55,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:55,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911703158] [2025-03-08 05:32:55,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911703158] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:55,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:55,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:32:55,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140741551] [2025-03-08 05:32:55,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:55,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:32:55,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:55,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:32:55,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:32:55,325 INFO L87 Difference]: Start difference. First operand 2496 states and 3720 transitions. Second operand has 8 states, 6 states have (on average 21.833333333333332) internal successors, (131), 8 states have internal predecessors, (131), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-08 05:32:55,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:55,469 INFO L93 Difference]: Finished difference Result 4876 states and 7304 transitions. [2025-03-08 05:32:55,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 05:32:55,470 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 21.833333333333332) internal successors, (131), 8 states have internal predecessors, (131), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) Word has length 218 [2025-03-08 05:32:55,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:55,482 INFO L225 Difference]: With dead ends: 4876 [2025-03-08 05:32:55,482 INFO L226 Difference]: Without dead ends: 2500 [2025-03-08 05:32:55,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:32:55,490 INFO L435 NwaCegarLoop]: 843 mSDtfsCounter, 3 mSDsluCounter, 5040 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 5883 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:55,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 5883 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:55,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2500 states. [2025-03-08 05:32:55,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2500 to 2500. [2025-03-08 05:32:55,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2500 states, 1913 states have (on average 1.4830109775222164) internal successors, (2837), 1949 states have internal predecessors, (2837), 408 states have call successors, (408), 168 states have call predecessors, (408), 178 states have return successors, (481), 404 states have call predecessors, (481), 404 states have call successors, (481) [2025-03-08 05:32:55,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3726 transitions. [2025-03-08 05:32:55,594 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3726 transitions. Word has length 218 [2025-03-08 05:32:55,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:55,595 INFO L471 AbstractCegarLoop]: Abstraction has 2500 states and 3726 transitions. [2025-03-08 05:32:55,595 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 21.833333333333332) internal successors, (131), 8 states have internal predecessors, (131), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (27), 3 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-08 05:32:55,595 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3726 transitions. [2025-03-08 05:32:55,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-08 05:32:55,609 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:55,609 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:55,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:32:55,609 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:55,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:55,610 INFO L85 PathProgramCache]: Analyzing trace with hash -793801437, now seen corresponding path program 1 times [2025-03-08 05:32:55,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:55,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555112099] [2025-03-08 05:32:55,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:55,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:55,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-08 05:32:55,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-08 05:32:55,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:55,641 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:55,767 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 05:32:55,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:55,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555112099] [2025-03-08 05:32:55,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555112099] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:55,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:55,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:32:55,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654439152] [2025-03-08 05:32:55,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:55,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:32:55,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:55,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:32:55,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:32:55,769 INFO L87 Difference]: Start difference. First operand 2500 states and 3726 transitions. Second operand has 9 states, 7 states have (on average 19.285714285714285) internal successors, (135), 8 states have internal predecessors, (135), 4 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-08 05:32:55,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:55,966 INFO L93 Difference]: Finished difference Result 4874 states and 7300 transitions. [2025-03-08 05:32:55,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:32:55,967 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 19.285714285714285) internal successors, (135), 8 states have internal predecessors, (135), 4 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 219 [2025-03-08 05:32:55,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:55,981 INFO L225 Difference]: With dead ends: 4874 [2025-03-08 05:32:55,981 INFO L226 Difference]: Without dead ends: 2504 [2025-03-08 05:32:55,988 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:32:55,989 INFO L435 NwaCegarLoop]: 835 mSDtfsCounter, 7 mSDsluCounter, 5815 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 6650 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:55,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 6650 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:32:55,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2504 states. [2025-03-08 05:32:56,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2504 to 2500. [2025-03-08 05:32:56,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2500 states, 1913 states have (on average 1.4830109775222164) internal successors, (2837), 1949 states have internal predecessors, (2837), 408 states have call successors, (408), 168 states have call predecessors, (408), 178 states have return successors, (479), 404 states have call predecessors, (479), 404 states have call successors, (479) [2025-03-08 05:32:56,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2500 states to 2500 states and 3724 transitions. [2025-03-08 05:32:56,084 INFO L78 Accepts]: Start accepts. Automaton has 2500 states and 3724 transitions. Word has length 219 [2025-03-08 05:32:56,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:56,086 INFO L471 AbstractCegarLoop]: Abstraction has 2500 states and 3724 transitions. [2025-03-08 05:32:56,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 19.285714285714285) internal successors, (135), 8 states have internal predecessors, (135), 4 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-08 05:32:56,086 INFO L276 IsEmpty]: Start isEmpty. Operand 2500 states and 3724 transitions. [2025-03-08 05:32:56,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2025-03-08 05:32:56,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:56,093 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:56,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:32:56,094 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:56,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:56,094 INFO L85 PathProgramCache]: Analyzing trace with hash -908618852, now seen corresponding path program 2 times [2025-03-08 05:32:56,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:56,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985634984] [2025-03-08 05:32:56,094 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:32:56,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:56,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 220 statements into 2 equivalence classes. [2025-03-08 05:32:56,120 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 109 of 220 statements. [2025-03-08 05:32:56,120 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:32:56,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-08 05:32:56,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:56,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985634984] [2025-03-08 05:32:56,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985634984] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:56,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:56,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 05:32:56,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838528949] [2025-03-08 05:32:56,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:56,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 05:32:56,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:56,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 05:32:56,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:32:56,153 INFO L87 Difference]: Start difference. First operand 2500 states and 3724 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 4 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-08 05:32:56,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:56,779 INFO L93 Difference]: Finished difference Result 6064 states and 9176 transitions. [2025-03-08 05:32:56,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 05:32:56,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 4 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) Word has length 220 [2025-03-08 05:32:56,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:56,804 INFO L225 Difference]: With dead ends: 6064 [2025-03-08 05:32:56,804 INFO L226 Difference]: Without dead ends: 3600 [2025-03-08 05:32:56,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 05:32:56,816 INFO L435 NwaCegarLoop]: 1561 mSDtfsCounter, 1476 mSDsluCounter, 1223 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1476 SdHoareTripleChecker+Valid, 2784 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:56,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1476 Valid, 2784 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 05:32:56,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3600 states. [2025-03-08 05:32:56,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3600 to 3598. [2025-03-08 05:32:56,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3598 states, 2775 states have (on average 1.4821621621621621) internal successors, (4113), 2814 states have internal predecessors, (4113), 570 states have call successors, (570), 243 states have call predecessors, (570), 252 states have return successors, (645), 558 states have call predecessors, (645), 564 states have call successors, (645) [2025-03-08 05:32:56,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3598 states to 3598 states and 5328 transitions. [2025-03-08 05:32:56,990 INFO L78 Accepts]: Start accepts. Automaton has 3598 states and 5328 transitions. Word has length 220 [2025-03-08 05:32:56,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:56,991 INFO L471 AbstractCegarLoop]: Abstraction has 3598 states and 5328 transitions. [2025-03-08 05:32:56,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 4 states have call successors, (36), 3 states have call predecessors, (36), 2 states have return successors, (27), 4 states have call predecessors, (27), 4 states have call successors, (27) [2025-03-08 05:32:56,991 INFO L276 IsEmpty]: Start isEmpty. Operand 3598 states and 5328 transitions. [2025-03-08 05:32:57,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2025-03-08 05:32:57,002 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:57,002 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:57,002 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:32:57,002 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:57,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:57,004 INFO L85 PathProgramCache]: Analyzing trace with hash 571391661, now seen corresponding path program 1 times [2025-03-08 05:32:57,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:57,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315126986] [2025-03-08 05:32:57,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:57,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:57,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 224 statements into 1 equivalence classes. [2025-03-08 05:32:57,035 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 224 of 224 statements. [2025-03-08 05:32:57,035 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:57,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:57,163 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-03-08 05:32:57,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:57,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315126986] [2025-03-08 05:32:57,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315126986] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:57,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:57,164 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-08 05:32:57,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801910886] [2025-03-08 05:32:57,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:57,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 05:32:57,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:57,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 05:32:57,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2025-03-08 05:32:57,165 INFO L87 Difference]: Start difference. First operand 3598 states and 5328 transitions. Second operand has 9 states, 7 states have (on average 19.714285714285715) internal successors, (138), 8 states have internal predecessors, (138), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-08 05:32:57,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:57,419 INFO L93 Difference]: Finished difference Result 7028 states and 10474 transitions. [2025-03-08 05:32:57,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 05:32:57,420 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 19.714285714285715) internal successors, (138), 8 states have internal predecessors, (138), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) Word has length 224 [2025-03-08 05:32:57,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:57,455 INFO L225 Difference]: With dead ends: 7028 [2025-03-08 05:32:57,455 INFO L226 Difference]: Without dead ends: 3610 [2025-03-08 05:32:57,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:32:57,464 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 4 mSDsluCounter, 5829 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 6666 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:57,464 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 6666 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:32:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3610 states. [2025-03-08 05:32:57,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3610 to 3604. [2025-03-08 05:32:57,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3604 states, 2778 states have (on average 1.4816414686825055) internal successors, (4116), 2820 states have internal predecessors, (4116), 570 states have call successors, (570), 243 states have call predecessors, (570), 255 states have return successors, (660), 558 states have call predecessors, (660), 564 states have call successors, (660) [2025-03-08 05:32:57,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3604 states to 3604 states and 5346 transitions. [2025-03-08 05:32:57,613 INFO L78 Accepts]: Start accepts. Automaton has 3604 states and 5346 transitions. Word has length 224 [2025-03-08 05:32:57,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:57,614 INFO L471 AbstractCegarLoop]: Abstraction has 3604 states and 5346 transitions. [2025-03-08 05:32:57,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 19.714285714285715) internal successors, (138), 8 states have internal predecessors, (138), 4 states have call successors, (37), 2 states have call predecessors, (37), 4 states have return successors, (28), 4 states have call predecessors, (28), 4 states have call successors, (28) [2025-03-08 05:32:57,614 INFO L276 IsEmpty]: Start isEmpty. Operand 3604 states and 5346 transitions. [2025-03-08 05:32:57,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-03-08 05:32:57,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:57,628 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:57,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:32:57,628 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:57,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:57,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1976653007, now seen corresponding path program 1 times [2025-03-08 05:32:57,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:57,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955632815] [2025-03-08 05:32:57,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:57,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:57,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 05:32:57,655 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 05:32:57,655 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:57,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:57,736 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:32:57,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:57,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955632815] [2025-03-08 05:32:57,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955632815] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:32:57,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1686846293] [2025-03-08 05:32:57,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:57,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:57,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:32:57,738 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:32:57,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 05:32:57,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-03-08 05:32:58,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-03-08 05:32:58,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:58,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:58,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 1624 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:32:58,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:32:58,087 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:32:58,090 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:32:58,240 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:32:58,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1686846293] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:32:58,240 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:32:58,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-08 05:32:58,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198698242] [2025-03-08 05:32:58,241 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:32:58,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:32:58,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:58,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:32:58,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:32:58,242 INFO L87 Difference]: Start difference. First operand 3604 states and 5346 transitions. Second operand has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-08 05:32:58,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:58,503 INFO L93 Difference]: Finished difference Result 8021 states and 12150 transitions. [2025-03-08 05:32:58,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:32:58,504 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 225 [2025-03-08 05:32:58,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:58,525 INFO L225 Difference]: With dead ends: 8021 [2025-03-08 05:32:58,526 INFO L226 Difference]: Without dead ends: 6259 [2025-03-08 05:32:58,532 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 452 GetRequests, 447 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:32:58,532 INFO L435 NwaCegarLoop]: 906 mSDtfsCounter, 632 mSDsluCounter, 2211 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 686 SdHoareTripleChecker+Valid, 3117 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:58,533 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [686 Valid, 3117 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:32:58,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6259 states. [2025-03-08 05:32:58,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6259 to 6121. [2025-03-08 05:32:58,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6121 states, 4914 states have (on average 1.525030525030525) internal successors, (7494), 4956 states have internal predecessors, (7494), 951 states have call successors, (951), 243 states have call predecessors, (951), 255 states have return successors, (1071), 939 states have call predecessors, (1071), 945 states have call successors, (1071) [2025-03-08 05:32:58,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6121 states to 6121 states and 9516 transitions. [2025-03-08 05:32:58,761 INFO L78 Accepts]: Start accepts. Automaton has 6121 states and 9516 transitions. Word has length 225 [2025-03-08 05:32:58,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:58,761 INFO L471 AbstractCegarLoop]: Abstraction has 6121 states and 9516 transitions. [2025-03-08 05:32:58,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 25.0) internal successors, (175), 7 states have internal predecessors, (175), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2025-03-08 05:32:58,761 INFO L276 IsEmpty]: Start isEmpty. Operand 6121 states and 9516 transitions. [2025-03-08 05:32:58,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-03-08 05:32:58,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:58,777 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:58,786 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 05:32:58,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:32:58,982 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:58,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:58,982 INFO L85 PathProgramCache]: Analyzing trace with hash 714105734, now seen corresponding path program 1 times [2025-03-08 05:32:58,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:58,982 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1576453683] [2025-03-08 05:32:58,982 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:58,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:59,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-03-08 05:32:59,010 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-03-08 05:32:59,010 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:59,010 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:59,048 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:32:59,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:59,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1576453683] [2025-03-08 05:32:59,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1576453683] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:59,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:59,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:59,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165234498] [2025-03-08 05:32:59,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:59,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:59,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:59,049 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:59,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:59,049 INFO L87 Difference]: Start difference. First operand 6121 states and 9516 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 05:32:59,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:32:59,200 INFO L93 Difference]: Finished difference Result 14192 states and 22348 transitions. [2025-03-08 05:32:59,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:32:59,201 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 230 [2025-03-08 05:32:59,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:32:59,235 INFO L225 Difference]: With dead ends: 14192 [2025-03-08 05:32:59,235 INFO L226 Difference]: Without dead ends: 8998 [2025-03-08 05:32:59,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:59,254 INFO L435 NwaCegarLoop]: 873 mSDtfsCounter, 163 mSDsluCounter, 837 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1710 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:32:59,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1710 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:32:59,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8998 states. [2025-03-08 05:32:59,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8998 to 8950. [2025-03-08 05:32:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8950 states, 7278 states have (on average 1.5399835119538334) internal successors, (11208), 7320 states have internal predecessors, (11208), 1416 states have call successors, (1416), 243 states have call predecessors, (1416), 255 states have return successors, (1566), 1404 states have call predecessors, (1566), 1410 states have call successors, (1566) [2025-03-08 05:32:59,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8950 states to 8950 states and 14190 transitions. [2025-03-08 05:32:59,694 INFO L78 Accepts]: Start accepts. Automaton has 8950 states and 14190 transitions. Word has length 230 [2025-03-08 05:32:59,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:32:59,695 INFO L471 AbstractCegarLoop]: Abstraction has 8950 states and 14190 transitions. [2025-03-08 05:32:59,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 05:32:59,695 INFO L276 IsEmpty]: Start isEmpty. Operand 8950 states and 14190 transitions. [2025-03-08 05:32:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-08 05:32:59,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:32:59,725 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:32:59,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:32:59,725 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:32:59,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:32:59,726 INFO L85 PathProgramCache]: Analyzing trace with hash -337663814, now seen corresponding path program 1 times [2025-03-08 05:32:59,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:32:59,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654494785] [2025-03-08 05:32:59,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:32:59,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:32:59,750 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-08 05:32:59,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-08 05:32:59,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:32:59,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:32:59,792 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:32:59,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:32:59,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654494785] [2025-03-08 05:32:59,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654494785] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:32:59,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:32:59,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:32:59,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871667352] [2025-03-08 05:32:59,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:32:59,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:32:59,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:32:59,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:32:59,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:32:59,794 INFO L87 Difference]: Start difference. First operand 8950 states and 14190 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 05:33:00,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:00,057 INFO L93 Difference]: Finished difference Result 21344 states and 34153 transitions. [2025-03-08 05:33:00,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:00,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 231 [2025-03-08 05:33:00,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:00,109 INFO L225 Difference]: With dead ends: 21344 [2025-03-08 05:33:00,110 INFO L226 Difference]: Without dead ends: 13108 [2025-03-08 05:33:00,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-03-08 05:33:00,129 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 161 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:33:00,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 1696 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:00,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13108 states. [2025-03-08 05:33:00,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13108 to 13060. [2025-03-08 05:33:00,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13060 states, 10761 states have (on average 1.5525508781711737) internal successors, (16707), 10803 states have internal predecessors, (16707), 2043 states have call successors, (2043), 243 states have call predecessors, (2043), 255 states have return successors, (2193), 2031 states have call predecessors, (2193), 2037 states have call successors, (2193) [2025-03-08 05:33:00,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13060 states to 13060 states and 20943 transitions. [2025-03-08 05:33:00,636 INFO L78 Accepts]: Start accepts. Automaton has 13060 states and 20943 transitions. Word has length 231 [2025-03-08 05:33:00,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:00,636 INFO L471 AbstractCegarLoop]: Abstraction has 13060 states and 20943 transitions. [2025-03-08 05:33:00,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 3 states have internal predecessors, (139), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 05:33:00,637 INFO L276 IsEmpty]: Start isEmpty. Operand 13060 states and 20943 transitions. [2025-03-08 05:33:00,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2025-03-08 05:33:00,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:00,671 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:00,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:33:00,671 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:00,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:00,672 INFO L85 PathProgramCache]: Analyzing trace with hash 520412773, now seen corresponding path program 1 times [2025-03-08 05:33:00,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:00,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315037511] [2025-03-08 05:33:00,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:00,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:00,690 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 232 statements into 1 equivalence classes. [2025-03-08 05:33:00,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 232 of 232 statements. [2025-03-08 05:33:00,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:00,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:00,734 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:33:00,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:00,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315037511] [2025-03-08 05:33:00,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315037511] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:00,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:00,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:00,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389524873] [2025-03-08 05:33:00,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:00,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:00,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:00,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:00,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:00,736 INFO L87 Difference]: Start difference. First operand 13060 states and 20943 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 05:33:01,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:01,118 INFO L93 Difference]: Finished difference Result 30962 states and 50077 transitions. [2025-03-08 05:33:01,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:01,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 232 [2025-03-08 05:33:01,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:01,183 INFO L225 Difference]: With dead ends: 30962 [2025-03-08 05:33:01,184 INFO L226 Difference]: Without dead ends: 19444 [2025-03-08 05:33:01,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:01,208 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 159 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:33:01,209 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 1691 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:01,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19444 states. [2025-03-08 05:33:01,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19444 to 19396. [2025-03-08 05:33:01,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19396 states, 16239 states have (on average 1.563643081470534) internal successors, (25392), 16281 states have internal predecessors, (25392), 2901 states have call successors, (2901), 243 states have call predecessors, (2901), 255 states have return successors, (3099), 2889 states have call predecessors, (3099), 2895 states have call successors, (3099) [2025-03-08 05:33:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19396 states to 19396 states and 31392 transitions. [2025-03-08 05:33:01,961 INFO L78 Accepts]: Start accepts. Automaton has 19396 states and 31392 transitions. Word has length 232 [2025-03-08 05:33:01,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:01,961 INFO L471 AbstractCegarLoop]: Abstraction has 19396 states and 31392 transitions. [2025-03-08 05:33:01,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 05:33:01,962 INFO L276 IsEmpty]: Start isEmpty. Operand 19396 states and 31392 transitions. [2025-03-08 05:33:02,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2025-03-08 05:33:02,018 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:02,019 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:02,019 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-08 05:33:02,019 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:02,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:02,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1342488901, now seen corresponding path program 1 times [2025-03-08 05:33:02,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:02,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725897080] [2025-03-08 05:33:02,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:02,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:02,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 233 statements into 1 equivalence classes. [2025-03-08 05:33:02,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 233 of 233 statements. [2025-03-08 05:33:02,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:02,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:02,095 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:33:02,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:02,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725897080] [2025-03-08 05:33:02,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725897080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:02,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:02,096 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:02,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414271230] [2025-03-08 05:33:02,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:02,097 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:02,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:02,097 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:02,097 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:02,097 INFO L87 Difference]: Start difference. First operand 19396 states and 31392 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 05:33:02,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:02,953 INFO L93 Difference]: Finished difference Result 46517 states and 75910 transitions. [2025-03-08 05:33:02,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:02,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 233 [2025-03-08 05:33:02,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:03,051 INFO L225 Difference]: With dead ends: 46517 [2025-03-08 05:33:03,052 INFO L226 Difference]: Without dead ends: 29884 [2025-03-08 05:33:03,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:03,081 INFO L435 NwaCegarLoop]: 851 mSDtfsCounter, 157 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:33:03,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 1691 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:03,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29884 states. [2025-03-08 05:33:03,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29884 to 29836. [2025-03-08 05:33:03,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29836 states, 25356 states have (on average 1.573828679602461) internal successors, (39906), 25398 states have internal predecessors, (39906), 4224 states have call successors, (4224), 243 states have call predecessors, (4224), 255 states have return successors, (4500), 4212 states have call predecessors, (4500), 4218 states have call successors, (4500) [2025-03-08 05:33:03,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29836 states to 29836 states and 48630 transitions. [2025-03-08 05:33:03,986 INFO L78 Accepts]: Start accepts. Automaton has 29836 states and 48630 transitions. Word has length 233 [2025-03-08 05:33:03,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:03,987 INFO L471 AbstractCegarLoop]: Abstraction has 29836 states and 48630 transitions. [2025-03-08 05:33:03,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 05:33:03,987 INFO L276 IsEmpty]: Start isEmpty. Operand 29836 states and 48630 transitions. [2025-03-08 05:33:04,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-03-08 05:33:04,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:04,070 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:04,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-08 05:33:04,070 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:04,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:04,071 INFO L85 PathProgramCache]: Analyzing trace with hash 501054436, now seen corresponding path program 1 times [2025-03-08 05:33:04,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:04,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [979688321] [2025-03-08 05:33:04,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:04,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:04,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-03-08 05:33:04,099 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-03-08 05:33:04,099 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:04,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:04,131 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:33:04,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:04,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [979688321] [2025-03-08 05:33:04,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [979688321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:04,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:04,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:04,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343911468] [2025-03-08 05:33:04,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:04,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:04,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:04,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:04,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:04,134 INFO L87 Difference]: Start difference. First operand 29836 states and 48630 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 05:33:04,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:04,981 INFO L93 Difference]: Finished difference Result 73166 states and 119974 transitions. [2025-03-08 05:33:04,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:04,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 234 [2025-03-08 05:33:04,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:05,173 INFO L225 Difference]: With dead ends: 73166 [2025-03-08 05:33:05,173 INFO L226 Difference]: Without dead ends: 47827 [2025-03-08 05:33:05,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:05,233 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 155 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 1707 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:33:05,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 1707 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:05,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47827 states. [2025-03-08 05:33:07,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47827 to 47779. [2025-03-08 05:33:07,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47779 states, 40566 states have (on average 1.5724005324656116) internal successors, (63786), 40608 states have internal predecessors, (63786), 6957 states have call successors, (6957), 243 states have call predecessors, (6957), 255 states have return successors, (7365), 6945 states have call predecessors, (7365), 6951 states have call successors, (7365) [2025-03-08 05:33:07,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47779 states to 47779 states and 78108 transitions. [2025-03-08 05:33:07,306 INFO L78 Accepts]: Start accepts. Automaton has 47779 states and 78108 transitions. Word has length 234 [2025-03-08 05:33:07,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:07,306 INFO L471 AbstractCegarLoop]: Abstraction has 47779 states and 78108 transitions. [2025-03-08 05:33:07,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 05:33:07,306 INFO L276 IsEmpty]: Start isEmpty. Operand 47779 states and 78108 transitions. [2025-03-08 05:33:07,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-03-08 05:33:07,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:07,473 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:07,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-08 05:33:07,474 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:07,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:07,475 INFO L85 PathProgramCache]: Analyzing trace with hash -2147339972, now seen corresponding path program 1 times [2025-03-08 05:33:07,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:07,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786591303] [2025-03-08 05:33:07,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:07,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:07,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-03-08 05:33:07,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-03-08 05:33:07,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:07,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:07,560 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:33:07,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:07,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786591303] [2025-03-08 05:33:07,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786591303] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:07,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:07,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:07,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957042087] [2025-03-08 05:33:07,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:07,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:07,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:07,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:07,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:07,562 INFO L87 Difference]: Start difference. First operand 47779 states and 78108 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 05:33:09,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:09,200 INFO L93 Difference]: Finished difference Result 122183 states and 201349 transitions. [2025-03-08 05:33:09,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:09,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 235 [2025-03-08 05:33:09,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:09,590 INFO L225 Difference]: With dead ends: 122183 [2025-03-08 05:33:09,591 INFO L226 Difference]: Without dead ends: 80926 [2025-03-08 05:33:09,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:09,726 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 153 mSDsluCounter, 843 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 1696 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:33:09,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 1696 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:09,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80926 states. [2025-03-08 05:33:12,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80926 to 80878. [2025-03-08 05:33:12,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80878 states, 68991 states have (on average 1.5792929512545115) internal successors, (108957), 69033 states have internal predecessors, (108957), 11631 states have call successors, (11631), 243 states have call predecessors, (11631), 255 states have return successors, (12273), 11619 states have call predecessors, (12273), 11625 states have call successors, (12273) [2025-03-08 05:33:13,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80878 states to 80878 states and 132861 transitions. [2025-03-08 05:33:13,278 INFO L78 Accepts]: Start accepts. Automaton has 80878 states and 132861 transitions. Word has length 235 [2025-03-08 05:33:13,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:13,279 INFO L471 AbstractCegarLoop]: Abstraction has 80878 states and 132861 transitions. [2025-03-08 05:33:13,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 05:33:13,279 INFO L276 IsEmpty]: Start isEmpty. Operand 80878 states and 132861 transitions. [2025-03-08 05:33:13,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-03-08 05:33:13,711 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:13,711 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:13,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-08 05:33:13,712 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:13,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:13,712 INFO L85 PathProgramCache]: Analyzing trace with hash -445424381, now seen corresponding path program 1 times [2025-03-08 05:33:13,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:13,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294054202] [2025-03-08 05:33:13,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:13,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:13,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-03-08 05:33:13,737 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-03-08 05:33:13,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:13,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:13,769 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:33:13,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:13,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294054202] [2025-03-08 05:33:13,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294054202] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:13,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:13,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:13,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050876352] [2025-03-08 05:33:13,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:13,770 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:13,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:13,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:13,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:13,771 INFO L87 Difference]: Start difference. First operand 80878 states and 132861 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 05:33:16,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:16,381 INFO L93 Difference]: Finished difference Result 199163 states and 325525 transitions. [2025-03-08 05:33:16,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:16,381 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 236 [2025-03-08 05:33:16,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:16,837 INFO L225 Difference]: With dead ends: 199163 [2025-03-08 05:33:16,837 INFO L226 Difference]: Without dead ends: 129496 [2025-03-08 05:33:17,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:17,116 INFO L435 NwaCegarLoop]: 869 mSDtfsCounter, 151 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1685 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:33:17,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1685 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:17,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129496 states. [2025-03-08 05:33:21,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129496 to 129448. [2025-03-08 05:33:21,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129448 states, 110604 states have (on average 1.5514267115113378) internal successors, (171594), 110646 states have internal predecessors, (171594), 18588 states have call successors, (18588), 243 states have call predecessors, (18588), 255 states have return successors, (19662), 18576 states have call predecessors, (19662), 18582 states have call successors, (19662) [2025-03-08 05:33:21,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129448 states to 129448 states and 209844 transitions. [2025-03-08 05:33:21,735 INFO L78 Accepts]: Start accepts. Automaton has 129448 states and 209844 transitions. Word has length 236 [2025-03-08 05:33:21,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:21,735 INFO L471 AbstractCegarLoop]: Abstraction has 129448 states and 209844 transitions. [2025-03-08 05:33:21,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2025-03-08 05:33:21,736 INFO L276 IsEmpty]: Start isEmpty. Operand 129448 states and 209844 transitions. [2025-03-08 05:33:22,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-03-08 05:33:22,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:22,092 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:22,094 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-08 05:33:22,094 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION === [incoming__before__AutoResponderErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:22,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:22,094 INFO L85 PathProgramCache]: Analyzing trace with hash 941491645, now seen corresponding path program 1 times [2025-03-08 05:33:22,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:22,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913892518] [2025-03-08 05:33:22,095 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:22,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:22,112 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-03-08 05:33:22,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-03-08 05:33:22,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:22,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:22,152 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-08 05:33:22,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:22,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913892518] [2025-03-08 05:33:22,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913892518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:22,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:22,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:22,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525308638] [2025-03-08 05:33:22,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:22,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:22,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:22,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:22,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:22,155 INFO L87 Difference]: Start difference. First operand 129448 states and 209844 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 2 states have call successors, (37), 2 states have call predecessors, (37), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28)